Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788700187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 512K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716953475336

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 03:31:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:31:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:31:17] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-29 03:31:17] [INFO ] Transformed 2103 places.
[2024-05-29 03:31:17] [INFO ] Transformed 1953 transitions.
[2024-05-29 03:31:17] [INFO ] Found NUPN structural information;
[2024-05-29 03:31:17] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 323 places :
Symmetric choice reduction at 0 with 323 rule applications. Total rules 323 place count 1780 transition count 1630
Iterating global reduction 0 with 323 rules applied. Total rules applied 646 place count 1780 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 1779 transition count 1629
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 1779 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 1778 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 1778 transition count 1628
Applied a total of 650 rules in 804 ms. Remains 1778 /2103 variables (removed 325) and now considering 1628/1953 (removed 325) transitions.
// Phase 1: matrix 1628 rows 1778 cols
[2024-05-29 03:31:18] [INFO ] Computed 271 invariants in 37 ms
[2024-05-29 03:31:19] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-05-29 03:31:19] [INFO ] Invariant cache hit.
[2024-05-29 03:31:20] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
[2024-05-29 03:31:20] [INFO ] Invariant cache hit.
[2024-05-29 03:31:21] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1778/2103 places, 1628/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4131 ms. Remains : 1778/2103 places, 1628/1953 transitions.
Support contains 32 out of 1778 places after structural reductions.
[2024-05-29 03:31:22] [INFO ] Flatten gal took : 130 ms
[2024-05-29 03:31:22] [INFO ] Flatten gal took : 76 ms
[2024-05-29 03:31:22] [INFO ] Input system was already deterministic with 1628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-29 03:31:23] [INFO ] Invariant cache hit.
[2024-05-29 03:31:23] [INFO ] [Real]Absence check using 271 positive place invariants in 84 ms returned sat
[2024-05-29 03:31:23] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 03:31:24] [INFO ] [Nat]Absence check using 271 positive place invariants in 92 ms returned sat
[2024-05-29 03:31:25] [INFO ] After 1257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 03:31:26] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 8 ms to minimize.
[2024-05-29 03:31:26] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 2 ms to minimize.
[2024-05-29 03:31:27] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 1 ms to minimize.
[2024-05-29 03:31:27] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2024-05-29 03:31:27] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 0 ms to minimize.
[2024-05-29 03:31:28] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 1 ms to minimize.
[2024-05-29 03:31:28] [INFO ] Deduced a trap composed of 29 places in 325 ms of which 1 ms to minimize.
[2024-05-29 03:31:29] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 1 ms to minimize.
[2024-05-29 03:31:29] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 1 ms to minimize.
[2024-05-29 03:31:29] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 0 ms to minimize.
[2024-05-29 03:31:30] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 1 ms to minimize.
[2024-05-29 03:31:30] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 1 ms to minimize.
[2024-05-29 03:31:30] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 1 ms to minimize.
[2024-05-29 03:31:31] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 1 ms to minimize.
[2024-05-29 03:31:31] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 1 ms to minimize.
[2024-05-29 03:31:31] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 1 ms to minimize.
[2024-05-29 03:31:32] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2024-05-29 03:31:32] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2024-05-29 03:31:32] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 1 ms to minimize.
[2024-05-29 03:31:32] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 1 ms to minimize.
[2024-05-29 03:31:33] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 0 ms to minimize.
[2024-05-29 03:31:33] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 0 ms to minimize.
[2024-05-29 03:31:33] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 1 ms to minimize.
[2024-05-29 03:31:34] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 0 ms to minimize.
[2024-05-29 03:31:34] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 1 ms to minimize.
[2024-05-29 03:31:34] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2024-05-29 03:31:34] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 1 ms to minimize.
[2024-05-29 03:31:35] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2024-05-29 03:31:35] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 0 ms to minimize.
[2024-05-29 03:31:35] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2024-05-29 03:31:35] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 1 ms to minimize.
[2024-05-29 03:31:35] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2024-05-29 03:31:36] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 1 ms to minimize.
[2024-05-29 03:31:36] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 4 ms to minimize.
[2024-05-29 03:31:36] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 1 ms to minimize.
[2024-05-29 03:31:36] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 1 ms to minimize.
[2024-05-29 03:31:37] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 1 ms to minimize.
[2024-05-29 03:31:37] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2024-05-29 03:31:37] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 0 ms to minimize.
[2024-05-29 03:31:37] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2024-05-29 03:31:37] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2024-05-29 03:31:38] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2024-05-29 03:31:38] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2024-05-29 03:31:38] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
[2024-05-29 03:31:38] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2024-05-29 03:31:38] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2024-05-29 03:31:38] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 12993 ms
[2024-05-29 03:31:39] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2024-05-29 03:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-29 03:31:39] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2024-05-29 03:31:39] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2024-05-29 03:31:40] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 0 ms to minimize.
[2024-05-29 03:31:40] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 0 ms to minimize.
[2024-05-29 03:31:40] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 1 ms to minimize.
[2024-05-29 03:31:40] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2024-05-29 03:31:41] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2024-05-29 03:31:41] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 1 ms to minimize.
[2024-05-29 03:31:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2135 ms
[2024-05-29 03:31:42] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 4 ms to minimize.
[2024-05-29 03:31:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-05-29 03:31:42] [INFO ] After 17630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 548 ms.
[2024-05-29 03:31:42] [INFO ] After 18984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 359 ms.
Support contains 18 out of 1778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 1778 transition count 1281
Reduce places removed 347 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 350 rules applied. Total rules applied 697 place count 1431 transition count 1278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 700 place count 1428 transition count 1278
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 700 place count 1428 transition count 1043
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1170 place count 1193 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1172 place count 1191 transition count 1041
Iterating global reduction 3 with 2 rules applied. Total rules applied 1174 place count 1191 transition count 1041
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1174 place count 1191 transition count 1040
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1176 place count 1190 transition count 1040
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 5 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2190 place count 683 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2191 place count 683 transition count 532
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2193 place count 682 transition count 531
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2367 place count 595 transition count 586
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2368 place count 595 transition count 585
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2369 place count 595 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2370 place count 594 transition count 584
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 2399 place count 594 transition count 584
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2400 place count 593 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2402 place count 591 transition count 583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2402 place count 591 transition count 582
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2404 place count 590 transition count 582
Applied a total of 2404 rules in 385 ms. Remains 590 /1778 variables (removed 1188) and now considering 582/1628 (removed 1046) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 590/1778 places, 582/1628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 582 rows 590 cols
[2024-05-29 03:31:44] [INFO ] Computed 269 invariants in 15 ms
[2024-05-29 03:31:44] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 03:31:44] [INFO ] [Nat]Absence check using 269 positive place invariants in 33 ms returned sat
[2024-05-29 03:31:44] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 03:31:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:31:44] [INFO ] After 139ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 03:31:45] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 137 ms.
[2024-05-29 03:31:45] [INFO ] After 1044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 62 ms.
Support contains 10 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 582/582 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 580
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 588 transition count 580
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 588 transition count 578
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 586 transition count 578
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 584 transition count 576
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 583 transition count 577
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 583 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 582 transition count 576
Applied a total of 16 rules in 80 ms. Remains 582 /590 variables (removed 8) and now considering 576/582 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 582/590 places, 576/582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 169143 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169143 steps, saw 115388 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 576 rows 582 cols
[2024-05-29 03:31:48] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:31:49] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:31:49] [INFO ] [Nat]Absence check using 269 positive place invariants in 38 ms returned sat
[2024-05-29 03:31:49] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:31:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:31:49] [INFO ] After 119ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:31:49] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-29 03:31:49] [INFO ] After 915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 60 ms.
Support contains 10 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 582 /582 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 582/582 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 582 /582 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-29 03:31:50] [INFO ] Invariant cache hit.
[2024-05-29 03:31:50] [INFO ] Implicit Places using invariants in 422 ms returned [571]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 581/582 places, 576/576 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 580 transition count 575
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 580 transition count 575
Applied a total of 2 rules in 27 ms. Remains 580 /581 variables (removed 1) and now considering 575/576 (removed 1) transitions.
// Phase 1: matrix 575 rows 580 cols
[2024-05-29 03:31:50] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:31:50] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-29 03:31:50] [INFO ] Invariant cache hit.
[2024-05-29 03:31:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-29 03:31:51] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 580/582 places, 575/576 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1571 ms. Remains : 580/582 places, 575/576 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 201440 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201440 steps, saw 137640 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 03:31:55] [INFO ] Invariant cache hit.
[2024-05-29 03:31:55] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:31:55] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:31:55] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:31:55] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-29 03:31:55] [INFO ] After 109ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:31:55] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-29 03:31:56] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 49 ms.
Support contains 10 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 575/575 transitions.
Applied a total of 0 rules in 15 ms. Remains 580 /580 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 580/580 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 575/575 transitions.
Applied a total of 0 rules in 11 ms. Remains 580 /580 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2024-05-29 03:31:56] [INFO ] Invariant cache hit.
[2024-05-29 03:31:56] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-29 03:31:56] [INFO ] Invariant cache hit.
[2024-05-29 03:31:56] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-29 03:31:57] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2024-05-29 03:31:57] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-29 03:31:57] [INFO ] Invariant cache hit.
[2024-05-29 03:31:57] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1440 ms. Remains : 580/580 places, 575/575 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 580 transition count 575
Applied a total of 62 rules in 45 ms. Remains 580 /580 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 575 rows 580 cols
[2024-05-29 03:31:57] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:31:57] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:31:57] [INFO ] [Nat]Absence check using 268 positive place invariants in 38 ms returned sat
[2024-05-29 03:31:58] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:31:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-29 03:31:58] [INFO ] After 168ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:31:58] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 127 ms.
[2024-05-29 03:31:58] [INFO ] After 988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA ShieldIIPt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 480 stabilizing places and 480 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(!p0)))'
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1771 transition count 1621
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1771 transition count 1621
Applied a total of 14 rules in 187 ms. Remains 1771 /1778 variables (removed 7) and now considering 1621/1628 (removed 7) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-29 03:31:59] [INFO ] Computed 271 invariants in 7 ms
[2024-05-29 03:31:59] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-29 03:31:59] [INFO ] Invariant cache hit.
[2024-05-29 03:32:01] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
[2024-05-29 03:32:01] [INFO ] Invariant cache hit.
[2024-05-29 03:32:02] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1778 places, 1621/1628 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3222 ms. Remains : 1771/1778 places, 1621/1628 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1720 0) (EQ s1664 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-00 finished in 3472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 1778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1777 transition count 1269
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 1419 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 1418 transition count 1268
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 718 place count 1418 transition count 1030
Deduced a syphon composed of 238 places in 3 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1194 place count 1180 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1199 place count 1175 transition count 1025
Iterating global reduction 3 with 5 rules applied. Total rules applied 1204 place count 1175 transition count 1025
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1204 place count 1175 transition count 1023
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1208 place count 1173 transition count 1023
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2226 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 664 transition count 513
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2229 place count 663 transition count 512
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2405 place count 575 transition count 569
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2407 place count 573 transition count 567
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2409 place count 571 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2409 place count 571 transition count 566
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2411 place count 570 transition count 566
Applied a total of 2411 rules in 297 ms. Remains 570 /1778 variables (removed 1208) and now considering 566/1628 (removed 1062) transitions.
// Phase 1: matrix 566 rows 570 cols
[2024-05-29 03:32:02] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:32:03] [INFO ] Implicit Places using invariants in 433 ms returned [559]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 435 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/1778 places, 566/1628 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 565
Applied a total of 2 rules in 19 ms. Remains 568 /569 variables (removed 1) and now considering 565/566 (removed 1) transitions.
// Phase 1: matrix 565 rows 568 cols
[2024-05-29 03:32:03] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:32:03] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-29 03:32:03] [INFO ] Invariant cache hit.
[2024-05-29 03:32:04] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 568/1778 places, 565/1628 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1709 ms. Remains : 568/1778 places, 565/1628 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s235 0) (EQ s287 1)), p1:(EQ s97 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 659 ms.
Product exploration explored 100000 steps with 0 reset in 761 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 254329 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254329 steps, saw 179078 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:32:08] [INFO ] Invariant cache hit.
[2024-05-29 03:32:09] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:32:09] [INFO ] [Nat]Absence check using 268 positive place invariants in 35 ms returned sat
[2024-05-29 03:32:09] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:32:09] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 03:32:09] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 565/565 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 568 transition count 564
Applied a total of 1 rules in 13 ms. Remains 568 /568 variables (removed 0) and now considering 564/565 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 568/568 places, 564/565 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 249915 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249915 steps, saw 176764 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 564 rows 568 cols
[2024-05-29 03:32:12] [INFO ] Computed 268 invariants in 4 ms
[2024-05-29 03:32:12] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:32:13] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:32:13] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:32:13] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 03:32:13] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 564/564 transitions.
Applied a total of 0 rules in 10 ms. Remains 568 /568 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 568/568 places, 564/564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 564/564 transitions.
Applied a total of 0 rules in 10 ms. Remains 568 /568 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2024-05-29 03:32:13] [INFO ] Invariant cache hit.
[2024-05-29 03:32:13] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-29 03:32:13] [INFO ] Invariant cache hit.
[2024-05-29 03:32:14] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2024-05-29 03:32:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:32:14] [INFO ] Invariant cache hit.
[2024-05-29 03:32:14] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1177 ms. Remains : 568/568 places, 564/564 transitions.
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 568 transition count 564
Applied a total of 58 rules in 33 ms. Remains 568 /568 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 564 rows 568 cols
[2024-05-29 03:32:14] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:32:14] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:32:14] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2024-05-29 03:32:15] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:32:15] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-29 03:32:15] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 568 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 568/568 places, 565/565 transitions.
Applied a total of 0 rules in 16 ms. Remains 568 /568 variables (removed 0) and now considering 565/565 (removed 0) transitions.
// Phase 1: matrix 565 rows 568 cols
[2024-05-29 03:32:15] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:32:15] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-29 03:32:15] [INFO ] Invariant cache hit.
[2024-05-29 03:32:16] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2024-05-29 03:32:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:32:16] [INFO ] Invariant cache hit.
[2024-05-29 03:32:16] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1245 ms. Remains : 568/568 places, 565/565 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 246688 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246688 steps, saw 173390 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:32:20] [INFO ] Invariant cache hit.
[2024-05-29 03:32:20] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:32:20] [INFO ] [Nat]Absence check using 268 positive place invariants in 36 ms returned sat
[2024-05-29 03:32:20] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:32:20] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-29 03:32:20] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 565/565 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 568 transition count 564
Applied a total of 1 rules in 11 ms. Remains 568 /568 variables (removed 0) and now considering 564/565 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 568/568 places, 564/565 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 250634 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250634 steps, saw 177205 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 564 rows 568 cols
[2024-05-29 03:32:23] [INFO ] Computed 268 invariants in 6 ms
[2024-05-29 03:32:24] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:32:24] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:32:24] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:32:24] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 03:32:24] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 564/564 transitions.
Applied a total of 0 rules in 9 ms. Remains 568 /568 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 568/568 places, 564/564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 564/564 transitions.
Applied a total of 0 rules in 17 ms. Remains 568 /568 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2024-05-29 03:32:24] [INFO ] Invariant cache hit.
[2024-05-29 03:32:24] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-29 03:32:24] [INFO ] Invariant cache hit.
[2024-05-29 03:32:25] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2024-05-29 03:32:25] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:32:25] [INFO ] Invariant cache hit.
[2024-05-29 03:32:25] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1248 ms. Remains : 568/568 places, 564/564 transitions.
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 568 transition count 564
Applied a total of 58 rules in 18 ms. Remains 568 /568 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 564 rows 568 cols
[2024-05-29 03:32:25] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:32:25] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:32:26] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2024-05-29 03:32:26] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:32:26] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-29 03:32:26] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 550 ms.
Product exploration explored 100000 steps with 0 reset in 711 ms.
Built C files in :
/tmp/ltsmin16734416322117411079
[2024-05-29 03:32:28] [INFO ] Computing symmetric may disable matrix : 565 transitions.
[2024-05-29 03:32:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:32:28] [INFO ] Computing symmetric may enable matrix : 565 transitions.
[2024-05-29 03:32:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:32:28] [INFO ] Computing Do-Not-Accords matrix : 565 transitions.
[2024-05-29 03:32:28] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:32:28] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16734416322117411079
Running compilation step : cd /tmp/ltsmin16734416322117411079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1450 ms.
Running link step : cd /tmp/ltsmin16734416322117411079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16734416322117411079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3794200322521042504.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 568 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 568/568 places, 565/565 transitions.
Applied a total of 0 rules in 14 ms. Remains 568 /568 variables (removed 0) and now considering 565/565 (removed 0) transitions.
// Phase 1: matrix 565 rows 568 cols
[2024-05-29 03:32:43] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:32:43] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-29 03:32:43] [INFO ] Invariant cache hit.
[2024-05-29 03:32:44] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2024-05-29 03:32:44] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:32:44] [INFO ] Invariant cache hit.
[2024-05-29 03:32:44] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1252 ms. Remains : 568/568 places, 565/565 transitions.
Built C files in :
/tmp/ltsmin2141866976699895341
[2024-05-29 03:32:44] [INFO ] Computing symmetric may disable matrix : 565 transitions.
[2024-05-29 03:32:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:32:44] [INFO ] Computing symmetric may enable matrix : 565 transitions.
[2024-05-29 03:32:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:32:44] [INFO ] Computing Do-Not-Accords matrix : 565 transitions.
[2024-05-29 03:32:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:32:44] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2141866976699895341
Running compilation step : cd /tmp/ltsmin2141866976699895341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1290 ms.
Running link step : cd /tmp/ltsmin2141866976699895341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2141866976699895341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1770112880367831932.hoa' '--buchi-type=spotba'
LTSmin run took 10474 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-02 finished in 53908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0 U (G(p0)||p1))))))))'
Support contains 4 out of 1778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1773 transition count 1623
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1773 transition count 1623
Applied a total of 10 rules in 220 ms. Remains 1773 /1778 variables (removed 5) and now considering 1623/1628 (removed 5) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2024-05-29 03:32:56] [INFO ] Computed 271 invariants in 13 ms
[2024-05-29 03:32:57] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-29 03:32:57] [INFO ] Invariant cache hit.
[2024-05-29 03:32:58] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2024-05-29 03:32:58] [INFO ] Invariant cache hit.
[2024-05-29 03:32:59] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1773/1778 places, 1623/1628 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3239 ms. Remains : 1773/1778 places, 1623/1628 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1720 0) (EQ s944 1)), p0:(OR (EQ s764 0) (EQ s919 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18427 reset in 616 ms.
Product exploration explored 100000 steps with 18462 reset in 594 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1773 stabilizing places and 479/1623 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:33:01] [INFO ] Invariant cache hit.
[2024-05-29 03:33:01] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:01] [INFO ] [Nat]Absence check using 271 positive place invariants in 82 ms returned sat
[2024-05-29 03:33:02] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:02] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 9 ms to minimize.
[2024-05-29 03:33:03] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 1 ms to minimize.
[2024-05-29 03:33:03] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 1 ms to minimize.
[2024-05-29 03:33:03] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 1 ms to minimize.
[2024-05-29 03:33:04] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 0 ms to minimize.
[2024-05-29 03:33:04] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 1 ms to minimize.
[2024-05-29 03:33:05] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 1 ms to minimize.
[2024-05-29 03:33:05] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 1 ms to minimize.
[2024-05-29 03:33:05] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2024-05-29 03:33:05] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 0 ms to minimize.
[2024-05-29 03:33:06] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 0 ms to minimize.
[2024-05-29 03:33:06] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 1 ms to minimize.
[2024-05-29 03:33:06] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 0 ms to minimize.
[2024-05-29 03:33:07] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2024-05-29 03:33:07] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 1 ms to minimize.
[2024-05-29 03:33:07] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 1 ms to minimize.
[2024-05-29 03:33:07] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 0 ms to minimize.
[2024-05-29 03:33:08] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2024-05-29 03:33:08] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 1 ms to minimize.
[2024-05-29 03:33:08] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 0 ms to minimize.
[2024-05-29 03:33:08] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 0 ms to minimize.
[2024-05-29 03:33:09] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 0 ms to minimize.
[2024-05-29 03:33:09] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 0 ms to minimize.
[2024-05-29 03:33:09] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 1 ms to minimize.
[2024-05-29 03:33:09] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 0 ms to minimize.
[2024-05-29 03:33:10] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2024-05-29 03:33:10] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2024-05-29 03:33:10] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 1 ms to minimize.
[2024-05-29 03:33:10] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2024-05-29 03:33:10] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 1 ms to minimize.
[2024-05-29 03:33:11] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2024-05-29 03:33:11] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 1 ms to minimize.
[2024-05-29 03:33:11] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2024-05-29 03:33:11] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2024-05-29 03:33:11] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 0 ms to minimize.
[2024-05-29 03:33:12] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 0 ms to minimize.
[2024-05-29 03:33:12] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 0 ms to minimize.
[2024-05-29 03:33:12] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 0 ms to minimize.
[2024-05-29 03:33:12] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 0 ms to minimize.
[2024-05-29 03:33:12] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2024-05-29 03:33:12] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 0 ms to minimize.
[2024-05-29 03:33:13] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2024-05-29 03:33:13] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 0 ms to minimize.
[2024-05-29 03:33:13] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 10799 ms
[2024-05-29 03:33:13] [INFO ] After 11607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-29 03:33:13] [INFO ] After 11981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1773 transition count 1266
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1416 transition count 1265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1415 transition count 1265
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 716 place count 1415 transition count 1025
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1196 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2214 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2215 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2395 place count 576 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2396 place count 576 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2425 place count 576 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2426 place count 575 transition count 571
Applied a total of 2426 rules in 205 ms. Remains 575 /1773 variables (removed 1198) and now considering 571/1623 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 575/1773 places, 571/1623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327351 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327351 steps, saw 213853 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 571 rows 575 cols
[2024-05-29 03:33:16] [INFO ] Computed 271 invariants in 2 ms
[2024-05-29 03:33:16] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:16] [INFO ] [Nat]Absence check using 271 positive place invariants in 36 ms returned sat
[2024-05-29 03:33:17] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 03:33:17] [INFO ] After 26ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:17] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 03:33:17] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 9 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 575/575 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 9 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2024-05-29 03:33:17] [INFO ] Invariant cache hit.
[2024-05-29 03:33:17] [INFO ] Implicit Places using invariants in 308 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 313 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 571/571 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 570
Applied a total of 2 rules in 11 ms. Remains 573 /574 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 573 cols
[2024-05-29 03:33:17] [INFO ] Computed 270 invariants in 1 ms
[2024-05-29 03:33:17] [INFO ] Implicit Places using invariants in 319 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 572/575 places, 570/571 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 15 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:33:17] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:33:18] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-29 03:33:18] [INFO ] Invariant cache hit.
[2024-05-29 03:33:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:33:18] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 571/575 places, 569/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1634 ms. Remains : 571/575 places, 569/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 334029 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334029 steps, saw 215372 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:33:22] [INFO ] Invariant cache hit.
[2024-05-29 03:33:22] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:22] [INFO ] [Nat]Absence check using 269 positive place invariants in 37 ms returned sat
[2024-05-29 03:33:22] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:33:22] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:22] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-29 03:33:22] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-29 03:33:22] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 10 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 9 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-29 03:33:22] [INFO ] Invariant cache hit.
[2024-05-29 03:33:22] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-29 03:33:22] [INFO ] Invariant cache hit.
[2024-05-29 03:33:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:33:23] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2024-05-29 03:33:23] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:33:23] [INFO ] Invariant cache hit.
[2024-05-29 03:33:23] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1321 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1515 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 23 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2024-05-29 03:33:23] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:33:24] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:24] [INFO ] [Nat]Absence check using 268 positive place invariants in 32 ms returned sat
[2024-05-29 03:33:24] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-29 03:33:24] [INFO ] After 64ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:24] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 03:33:24] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Applied a total of 0 rules in 92 ms. Remains 1773 /1773 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2024-05-29 03:33:25] [INFO ] Computed 271 invariants in 5 ms
[2024-05-29 03:33:25] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-29 03:33:25] [INFO ] Invariant cache hit.
[2024-05-29 03:33:27] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2024-05-29 03:33:27] [INFO ] Invariant cache hit.
[2024-05-29 03:33:28] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3124 ms. Remains : 1773/1773 places, 1623/1623 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1773 stabilizing places and 479/1623 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:33:28] [INFO ] Invariant cache hit.
[2024-05-29 03:33:28] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:29] [INFO ] [Nat]Absence check using 271 positive place invariants in 85 ms returned sat
[2024-05-29 03:33:29] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:30] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 1 ms to minimize.
[2024-05-29 03:33:30] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 1 ms to minimize.
[2024-05-29 03:33:30] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 1 ms to minimize.
[2024-05-29 03:33:31] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 0 ms to minimize.
[2024-05-29 03:33:31] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2024-05-29 03:33:31] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 1 ms to minimize.
[2024-05-29 03:33:32] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 1 ms to minimize.
[2024-05-29 03:33:32] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 5 ms to minimize.
[2024-05-29 03:33:32] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2024-05-29 03:33:33] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 1 ms to minimize.
[2024-05-29 03:33:33] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2024-05-29 03:33:33] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 1 ms to minimize.
[2024-05-29 03:33:33] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2024-05-29 03:33:34] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2024-05-29 03:33:34] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 0 ms to minimize.
[2024-05-29 03:33:34] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 1 ms to minimize.
[2024-05-29 03:33:35] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 1 ms to minimize.
[2024-05-29 03:33:35] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 1 ms to minimize.
[2024-05-29 03:33:35] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 0 ms to minimize.
[2024-05-29 03:33:35] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 1 ms to minimize.
[2024-05-29 03:33:36] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2024-05-29 03:33:36] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 0 ms to minimize.
[2024-05-29 03:33:36] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 0 ms to minimize.
[2024-05-29 03:33:36] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 0 ms to minimize.
[2024-05-29 03:33:36] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 1 ms to minimize.
[2024-05-29 03:33:37] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2024-05-29 03:33:37] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-05-29 03:33:37] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 0 ms to minimize.
[2024-05-29 03:33:37] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 0 ms to minimize.
[2024-05-29 03:33:37] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 0 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 0 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 0 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 1 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 0 ms to minimize.
[2024-05-29 03:33:39] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 1 ms to minimize.
[2024-05-29 03:33:39] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 0 ms to minimize.
[2024-05-29 03:33:39] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2024-05-29 03:33:39] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2024-05-29 03:33:39] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2024-05-29 03:33:40] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2024-05-29 03:33:40] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2024-05-29 03:33:40] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 0 ms to minimize.
[2024-05-29 03:33:40] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 10644 ms
[2024-05-29 03:33:40] [INFO ] After 11433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-29 03:33:40] [INFO ] After 11814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1773 transition count 1266
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1416 transition count 1265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1415 transition count 1265
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 716 place count 1415 transition count 1025
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1196 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2214 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2215 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2395 place count 576 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2396 place count 576 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2425 place count 576 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2426 place count 575 transition count 571
Applied a total of 2426 rules in 193 ms. Remains 575 /1773 variables (removed 1198) and now considering 571/1623 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 575/1773 places, 571/1623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 336238 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336238 steps, saw 219907 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 571 rows 575 cols
[2024-05-29 03:33:43] [INFO ] Computed 271 invariants in 4 ms
[2024-05-29 03:33:43] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:44] [INFO ] [Nat]Absence check using 271 positive place invariants in 38 ms returned sat
[2024-05-29 03:33:44] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 03:33:44] [INFO ] After 23ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:44] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 03:33:44] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 8 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 575/575 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 9 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2024-05-29 03:33:44] [INFO ] Invariant cache hit.
[2024-05-29 03:33:44] [INFO ] Implicit Places using invariants in 323 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 571/571 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 570
Applied a total of 2 rules in 29 ms. Remains 573 /574 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 573 cols
[2024-05-29 03:33:44] [INFO ] Computed 270 invariants in 1 ms
[2024-05-29 03:33:45] [INFO ] Implicit Places using invariants in 308 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 572/575 places, 570/571 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 15 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:33:45] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:33:45] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-29 03:33:45] [INFO ] Invariant cache hit.
[2024-05-29 03:33:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:33:45] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 571/575 places, 569/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1619 ms. Remains : 571/575 places, 569/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 330391 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330391 steps, saw 212827 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:33:49] [INFO ] Invariant cache hit.
[2024-05-29 03:33:49] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:49] [INFO ] [Nat]Absence check using 269 positive place invariants in 36 ms returned sat
[2024-05-29 03:33:49] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:33:49] [INFO ] After 25ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-29 03:33:49] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 03:33:49] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-29 03:33:49] [INFO ] Invariant cache hit.
[2024-05-29 03:33:49] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-29 03:33:49] [INFO ] Invariant cache hit.
[2024-05-29 03:33:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:33:50] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2024-05-29 03:33:50] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:33:50] [INFO ] Invariant cache hit.
[2024-05-29 03:33:50] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1253 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1515 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 16 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2024-05-29 03:33:50] [INFO ] Computed 268 invariants in 12 ms
[2024-05-29 03:33:50] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:51] [INFO ] [Nat]Absence check using 268 positive place invariants in 35 ms returned sat
[2024-05-29 03:33:51] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-29 03:33:51] [INFO ] After 55ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:51] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 03:33:51] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18505 reset in 586 ms.
Product exploration explored 100000 steps with 18513 reset in 590 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1773 transition count 1623
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 358 place count 1773 transition count 1714
Deduced a syphon composed of 478 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 478 place count 1773 transition count 1714
Performed 601 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1079 places in 1 ms
Iterating global reduction 1 with 601 rules applied. Total rules applied 1079 place count 1773 transition count 1716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1080 place count 1773 transition count 1715
Renaming transitions due to excessive name length > 1024 char.
Discarding 242 places :
Symmetric choice reduction at 2 with 242 rule applications. Total rules 1322 place count 1531 transition count 1471
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 2 with 242 rules applied. Total rules applied 1564 place count 1531 transition count 1471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 838 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1565 place count 1531 transition count 1471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1567 place count 1529 transition count 1469
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1569 place count 1529 transition count 1469
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -533
Deduced a syphon composed of 937 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1670 place count 1529 transition count 2002
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1771 place count 1428 transition count 1800
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1872 place count 1428 transition count 1800
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 852 places in 2 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1888 place count 1428 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1904 place count 1412 transition count 1860
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1920 place count 1412 transition count 1860
Deduced a syphon composed of 836 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1929 place count 1412 transition count 1851
Deduced a syphon composed of 836 places in 1 ms
Applied a total of 1929 rules in 966 ms. Remains 1412 /1773 variables (removed 361) and now considering 1851/1623 (removed -228) transitions.
[2024-05-29 03:33:54] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1851 rows 1412 cols
[2024-05-29 03:33:54] [INFO ] Computed 271 invariants in 9 ms
[2024-05-29 03:33:55] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1412/1773 places, 1851/1623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1936 ms. Remains : 1412/1773 places, 1851/1623 transitions.
Built C files in :
/tmp/ltsmin17276605179238117063
[2024-05-29 03:33:55] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17276605179238117063
Running compilation step : cd /tmp/ltsmin17276605179238117063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2835 ms.
Running link step : cd /tmp/ltsmin17276605179238117063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17276605179238117063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11390464176619778568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Applied a total of 0 rules in 61 ms. Remains 1773 /1773 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2024-05-29 03:34:10] [INFO ] Computed 271 invariants in 12 ms
[2024-05-29 03:34:11] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-29 03:34:11] [INFO ] Invariant cache hit.
[2024-05-29 03:34:12] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2024-05-29 03:34:12] [INFO ] Invariant cache hit.
[2024-05-29 03:34:13] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3029 ms. Remains : 1773/1773 places, 1623/1623 transitions.
Built C files in :
/tmp/ltsmin4600262263080061956
[2024-05-29 03:34:13] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4600262263080061956
Running compilation step : cd /tmp/ltsmin4600262263080061956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2805 ms.
Running link step : cd /tmp/ltsmin4600262263080061956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4600262263080061956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10971692557562693520.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:34:28] [INFO ] Flatten gal took : 58 ms
[2024-05-29 03:34:29] [INFO ] Flatten gal took : 53 ms
[2024-05-29 03:34:29] [INFO ] Time to serialize gal into /tmp/LTL6680890529575423111.gal : 13 ms
[2024-05-29 03:34:29] [INFO ] Time to serialize properties into /tmp/LTL17050812978456205005.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6680890529575423111.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7306400152352078945.hoa' '-atoms' '/tmp/LTL17050812978456205005.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17050812978456205005.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7306400152352078945.hoa
Detected timeout of ITS tools.
[2024-05-29 03:34:44] [INFO ] Flatten gal took : 103 ms
[2024-05-29 03:34:44] [INFO ] Flatten gal took : 77 ms
[2024-05-29 03:34:44] [INFO ] Time to serialize gal into /tmp/LTL4499398149031193324.gal : 23 ms
[2024-05-29 03:34:44] [INFO ] Time to serialize properties into /tmp/LTL10349056230260745956.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4499398149031193324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10349056230260745956.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F(("((p899==0)||(p1083==1))")U(("((p2037==0)||(p1112==1))")||(G("((p899==0)||(p1083==1))"))))))))))
Formula 0 simplified : XXXXG(!"((p899==0)||(p1083==1))" M !"((p2037==0)||(p1112==1))")
Detected timeout of ITS tools.
[2024-05-29 03:34:59] [INFO ] Flatten gal took : 37 ms
[2024-05-29 03:34:59] [INFO ] Applying decomposition
[2024-05-29 03:34:59] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4155406910736595856.txt' '-o' '/tmp/graph4155406910736595856.bin' '-w' '/tmp/graph4155406910736595856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4155406910736595856.bin' '-l' '-1' '-v' '-w' '/tmp/graph4155406910736595856.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:34:59] [INFO ] Decomposing Gal with order
[2024-05-29 03:34:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:35:00] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-29 03:35:00] [INFO ] Flatten gal took : 123 ms
[2024-05-29 03:35:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 35 ms.
[2024-05-29 03:35:00] [INFO ] Time to serialize gal into /tmp/LTL10897406327533609082.gal : 42 ms
[2024-05-29 03:35:00] [INFO ] Time to serialize properties into /tmp/LTL2571355936261600316.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10897406327533609082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2571355936261600316.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F(("((i13.i4.u285.p899==0)||(i16.i1.u339.p1083==1))")U(("((i29.i0.u634.p2037==0)||(i16.i4.u346.p1112==1))")||(G("((i13.i4.u...203
Formula 0 simplified : XXXXG(!"((i13.i4.u285.p899==0)||(i16.i1.u339.p1083==1))" M !"((i29.i0.u634.p2037==0)||(i16.i4.u346.p1112==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10637622381710023897
[2024-05-29 03:35:15] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10637622381710023897
Running compilation step : cd /tmp/ltsmin10637622381710023897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2829 ms.
Running link step : cd /tmp/ltsmin10637622381710023897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10637622381710023897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-03 finished in 154149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p1) U p2)||F(p3))))'
Support contains 6 out of 1778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1771 transition count 1621
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1771 transition count 1621
Applied a total of 14 rules in 130 ms. Remains 1771 /1778 variables (removed 7) and now considering 1621/1628 (removed 7) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-29 03:35:30] [INFO ] Computed 271 invariants in 8 ms
[2024-05-29 03:35:31] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-29 03:35:31] [INFO ] Invariant cache hit.
[2024-05-29 03:35:32] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2024-05-29 03:35:32] [INFO ] Invariant cache hit.
[2024-05-29 03:35:33] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1778 places, 1621/1628 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3236 ms. Remains : 1771/1778 places, 1621/1628 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1356 1), p2:(OR (EQ s1385 0) (EQ s1582 1)), p3:(EQ s261 1), p1:(OR (EQ s1524 0) (EQ s612 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1365 ms.
Product exploration explored 100000 steps with 50000 reset in 1366 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-030B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-08 finished in 6200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1771 transition count 1621
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1771 transition count 1621
Applied a total of 14 rules in 112 ms. Remains 1771 /1778 variables (removed 7) and now considering 1621/1628 (removed 7) transitions.
[2024-05-29 03:35:36] [INFO ] Invariant cache hit.
[2024-05-29 03:35:37] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-29 03:35:37] [INFO ] Invariant cache hit.
[2024-05-29 03:35:38] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
[2024-05-29 03:35:38] [INFO ] Invariant cache hit.
[2024-05-29 03:35:39] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1778 places, 1621/1628 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3132 ms. Remains : 1771/1778 places, 1621/1628 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s22 0) (EQ s1696 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 482 ms.
Entered a terminal (fully accepting) state of product in 434 steps with 0 reset in 10 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-09 finished in 3714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1777 transition count 1268
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 1418 transition count 1268
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 718 place count 1418 transition count 1029
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1196 place count 1179 transition count 1029
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1202 place count 1173 transition count 1023
Iterating global reduction 2 with 6 rules applied. Total rules applied 1208 place count 1173 transition count 1023
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1208 place count 1173 transition count 1020
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1214 place count 1170 transition count 1020
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2226 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2227 place count 664 transition count 513
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2229 place count 663 transition count 512
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2407 place count 574 transition count 571
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2408 place count 574 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2410 place count 572 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2412 place count 570 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2412 place count 570 transition count 568
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2414 place count 569 transition count 568
Applied a total of 2414 rules in 216 ms. Remains 569 /1778 variables (removed 1209) and now considering 568/1628 (removed 1060) transitions.
// Phase 1: matrix 568 rows 569 cols
[2024-05-29 03:35:40] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:35:40] [INFO ] Implicit Places using invariants in 338 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 342 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 568/1778 places, 568/1628 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 567
Applied a total of 2 rules in 13 ms. Remains 567 /568 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 567 cols
[2024-05-29 03:35:40] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:35:41] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-29 03:35:41] [INFO ] Invariant cache hit.
[2024-05-29 03:35:41] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/1778 places, 567/1628 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1513 ms. Remains : 567/1778 places, 567/1628 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s376 0) (NEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-10 finished in 1559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 4 out of 1778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1772 transition count 1622
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1772 transition count 1622
Applied a total of 12 rules in 131 ms. Remains 1772 /1778 variables (removed 6) and now considering 1622/1628 (removed 6) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2024-05-29 03:35:41] [INFO ] Computed 271 invariants in 7 ms
[2024-05-29 03:35:42] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-29 03:35:42] [INFO ] Invariant cache hit.
[2024-05-29 03:35:43] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2024-05-29 03:35:43] [INFO ] Invariant cache hit.
[2024-05-29 03:35:44] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1778 places, 1622/1628 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3055 ms. Remains : 1772/1778 places, 1622/1628 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s35 0) (EQ s296 1)), p0:(OR (EQ s626 0) (EQ s838 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 493 ms.
Product exploration explored 100000 steps with 0 reset in 688 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:35:46] [INFO ] Invariant cache hit.
[2024-05-29 03:35:46] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:35:47] [INFO ] [Nat]Absence check using 271 positive place invariants in 84 ms returned sat
[2024-05-29 03:35:48] [INFO ] After 805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:35:48] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 1 ms to minimize.
[2024-05-29 03:35:48] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 1 ms to minimize.
[2024-05-29 03:35:49] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 1 ms to minimize.
[2024-05-29 03:35:49] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 1 ms to minimize.
[2024-05-29 03:35:49] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2024-05-29 03:35:50] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 1 ms to minimize.
[2024-05-29 03:35:50] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 2 ms to minimize.
[2024-05-29 03:35:50] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 1 ms to minimize.
[2024-05-29 03:35:51] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 1 ms to minimize.
[2024-05-29 03:35:51] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2024-05-29 03:35:51] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2024-05-29 03:35:52] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2024-05-29 03:35:52] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 1 ms to minimize.
[2024-05-29 03:35:52] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2024-05-29 03:35:53] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 1 ms to minimize.
[2024-05-29 03:35:53] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2024-05-29 03:35:53] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 1 ms to minimize.
[2024-05-29 03:35:54] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 1 ms to minimize.
[2024-05-29 03:35:54] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 1 ms to minimize.
[2024-05-29 03:35:54] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 1 ms to minimize.
[2024-05-29 03:35:54] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 1 ms to minimize.
[2024-05-29 03:35:55] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 0 ms to minimize.
[2024-05-29 03:35:55] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 1 ms to minimize.
[2024-05-29 03:35:55] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 1 ms to minimize.
[2024-05-29 03:35:55] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 0 ms to minimize.
[2024-05-29 03:35:56] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 0 ms to minimize.
[2024-05-29 03:35:56] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 1 ms to minimize.
[2024-05-29 03:35:56] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 0 ms to minimize.
[2024-05-29 03:35:56] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 1 ms to minimize.
[2024-05-29 03:35:57] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 0 ms to minimize.
[2024-05-29 03:35:57] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 0 ms to minimize.
[2024-05-29 03:35:57] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 1 ms to minimize.
[2024-05-29 03:35:57] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 1 ms to minimize.
[2024-05-29 03:35:58] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 0 ms to minimize.
[2024-05-29 03:35:58] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 0 ms to minimize.
[2024-05-29 03:35:58] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2024-05-29 03:35:58] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2024-05-29 03:35:58] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2024-05-29 03:35:59] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 0 ms to minimize.
[2024-05-29 03:35:59] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2024-05-29 03:35:59] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2024-05-29 03:35:59] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 11424 ms
[2024-05-29 03:35:59] [INFO ] After 12373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2024-05-29 03:35:59] [INFO ] After 12854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 107 ms.
Support contains 4 out of 1772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1772 transition count 1267
Reduce places removed 355 places and 0 transitions.
Iterating post reduction 1 with 355 rules applied. Total rules applied 710 place count 1417 transition count 1267
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 243 Pre rules applied. Total rules applied 710 place count 1417 transition count 1024
Deduced a syphon composed of 243 places in 1 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 2 with 486 rules applied. Total rules applied 1196 place count 1174 transition count 1024
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2210 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2211 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2213 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2391 place count 577 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2392 place count 577 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 2421 place count 577 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2422 place count 576 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2424 place count 574 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2424 place count 574 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2426 place count 573 transition count 570
Applied a total of 2426 rules in 152 ms. Remains 573 /1772 variables (removed 1199) and now considering 570/1622 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 573/1772 places, 570/1622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 254823 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254823 steps, saw 163035 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 570 rows 573 cols
[2024-05-29 03:36:03] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:36:03] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:36:03] [INFO ] [Nat]Absence check using 269 positive place invariants in 42 ms returned sat
[2024-05-29 03:36:03] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 03:36:03] [INFO ] After 50ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:03] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-29 03:36:03] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 570/570 transitions.
Applied a total of 0 rules in 7 ms. Remains 573 /573 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 573/573 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 570/570 transitions.
Applied a total of 0 rules in 6 ms. Remains 573 /573 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-29 03:36:03] [INFO ] Invariant cache hit.
[2024-05-29 03:36:04] [INFO ] Implicit Places using invariants in 311 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 314 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 572/573 places, 570/570 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 12 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:36:04] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:04] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-29 03:36:04] [INFO ] Invariant cache hit.
[2024-05-29 03:36:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:36:05] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 571/573 places, 569/570 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1370 ms. Remains : 571/573 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 252345 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252345 steps, saw 161854 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:36:08] [INFO ] Invariant cache hit.
[2024-05-29 03:36:08] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:36:08] [INFO ] [Nat]Absence check using 268 positive place invariants in 36 ms returned sat
[2024-05-29 03:36:08] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:36:08] [INFO ] After 47ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:08] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-29 03:36:08] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 6 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 6 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-29 03:36:08] [INFO ] Invariant cache hit.
[2024-05-29 03:36:09] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-29 03:36:09] [INFO ] Invariant cache hit.
[2024-05-29 03:36:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:36:09] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2024-05-29 03:36:10] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 03:36:10] [INFO ] Invariant cache hit.
[2024-05-29 03:36:10] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1321 ms. Remains : 571/571 places, 569/569 transitions.
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 0 with 66 rules applied. Total rules applied 66 place count 571 transition count 569
Applied a total of 66 rules in 18 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:36:10] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:10] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:36:10] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2024-05-29 03:36:10] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:10] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-29 03:36:10] [INFO ] After 68ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:10] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 03:36:10] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 1772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Applied a total of 0 rules in 58 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2024-05-29 03:36:11] [INFO ] Computed 271 invariants in 12 ms
[2024-05-29 03:36:11] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-29 03:36:11] [INFO ] Invariant cache hit.
[2024-05-29 03:36:13] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2024-05-29 03:36:13] [INFO ] Invariant cache hit.
[2024-05-29 03:36:14] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2982 ms. Remains : 1772/1772 places, 1622/1622 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:36:14] [INFO ] Invariant cache hit.
[2024-05-29 03:36:14] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:36:15] [INFO ] [Nat]Absence check using 271 positive place invariants in 83 ms returned sat
[2024-05-29 03:36:16] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:16] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 1 ms to minimize.
[2024-05-29 03:36:16] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 1 ms to minimize.
[2024-05-29 03:36:17] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 0 ms to minimize.
[2024-05-29 03:36:17] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 0 ms to minimize.
[2024-05-29 03:36:17] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2024-05-29 03:36:18] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 0 ms to minimize.
[2024-05-29 03:36:18] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 1 ms to minimize.
[2024-05-29 03:36:18] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 1 ms to minimize.
[2024-05-29 03:36:19] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 1 ms to minimize.
[2024-05-29 03:36:19] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2024-05-29 03:36:19] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 1 ms to minimize.
[2024-05-29 03:36:20] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2024-05-29 03:36:20] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 1 ms to minimize.
[2024-05-29 03:36:20] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 12 ms to minimize.
[2024-05-29 03:36:21] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 0 ms to minimize.
[2024-05-29 03:36:21] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 0 ms to minimize.
[2024-05-29 03:36:21] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 0 ms to minimize.
[2024-05-29 03:36:22] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 1 ms to minimize.
[2024-05-29 03:36:22] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 1 ms to minimize.
[2024-05-29 03:36:22] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2024-05-29 03:36:22] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 1 ms to minimize.
[2024-05-29 03:36:23] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2024-05-29 03:36:23] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 0 ms to minimize.
[2024-05-29 03:36:23] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 0 ms to minimize.
[2024-05-29 03:36:23] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 1 ms to minimize.
[2024-05-29 03:36:24] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 1 ms to minimize.
[2024-05-29 03:36:24] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 1 ms to minimize.
[2024-05-29 03:36:24] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2024-05-29 03:36:24] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 1 ms to minimize.
[2024-05-29 03:36:25] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 0 ms to minimize.
[2024-05-29 03:36:25] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 1 ms to minimize.
[2024-05-29 03:36:25] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2024-05-29 03:36:25] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 0 ms to minimize.
[2024-05-29 03:36:26] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 0 ms to minimize.
[2024-05-29 03:36:26] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 0 ms to minimize.
[2024-05-29 03:36:26] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 0 ms to minimize.
[2024-05-29 03:36:26] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2024-05-29 03:36:26] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2024-05-29 03:36:27] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-05-29 03:36:27] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2024-05-29 03:36:27] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2024-05-29 03:36:27] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 11336 ms
[2024-05-29 03:36:27] [INFO ] After 12248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2024-05-29 03:36:27] [INFO ] After 12737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 1772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1772 transition count 1267
Reduce places removed 355 places and 0 transitions.
Iterating post reduction 1 with 355 rules applied. Total rules applied 710 place count 1417 transition count 1267
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 243 Pre rules applied. Total rules applied 710 place count 1417 transition count 1024
Deduced a syphon composed of 243 places in 1 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 2 with 486 rules applied. Total rules applied 1196 place count 1174 transition count 1024
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2210 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2211 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2213 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2391 place count 577 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2392 place count 577 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 2421 place count 577 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2422 place count 576 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2424 place count 574 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2424 place count 574 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2426 place count 573 transition count 570
Applied a total of 2426 rules in 148 ms. Remains 573 /1772 variables (removed 1199) and now considering 570/1622 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 573/1772 places, 570/1622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 256167 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256167 steps, saw 163973 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 570 rows 573 cols
[2024-05-29 03:36:31] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:36:31] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:36:31] [INFO ] [Nat]Absence check using 269 positive place invariants in 38 ms returned sat
[2024-05-29 03:36:31] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:31] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 03:36:31] [INFO ] After 46ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:31] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 03:36:31] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 570/570 transitions.
Applied a total of 0 rules in 7 ms. Remains 573 /573 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 573/573 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 570/570 transitions.
Applied a total of 0 rules in 6 ms. Remains 573 /573 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-29 03:36:31] [INFO ] Invariant cache hit.
[2024-05-29 03:36:32] [INFO ] Implicit Places using invariants in 314 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 315 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 572/573 places, 570/570 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 12 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:36:32] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:32] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-29 03:36:32] [INFO ] Invariant cache hit.
[2024-05-29 03:36:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:36:33] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 571/573 places, 569/570 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1377 ms. Remains : 571/573 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 257381 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257381 steps, saw 165214 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:36:36] [INFO ] Invariant cache hit.
[2024-05-29 03:36:36] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:36:36] [INFO ] [Nat]Absence check using 268 positive place invariants in 36 ms returned sat
[2024-05-29 03:36:36] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:36:36] [INFO ] After 41ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:36] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-29 03:36:36] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-29 03:36:36] [INFO ] Invariant cache hit.
[2024-05-29 03:36:37] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-29 03:36:37] [INFO ] Invariant cache hit.
[2024-05-29 03:36:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 03:36:38] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2024-05-29 03:36:38] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:36:38] [INFO ] Invariant cache hit.
[2024-05-29 03:36:38] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1461 ms. Remains : 571/571 places, 569/569 transitions.
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 0 with 66 rules applied. Total rules applied 66 place count 571 transition count 569
Applied a total of 66 rules in 13 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:36:38] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:38] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:36:38] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:36:38] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:38] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-29 03:36:38] [INFO ] After 67ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:36:39] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-29 03:36:39] [INFO ] After 602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 484 ms.
Product exploration explored 100000 steps with 0 reset in 666 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 1772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1772 transition count 1622
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 124 Pre rules applied. Total rules applied 355 place count 1772 transition count 1714
Deduced a syphon composed of 479 places in 1 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 479 place count 1772 transition count 1714
Performed 596 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1075 places in 1 ms
Iterating global reduction 1 with 596 rules applied. Total rules applied 1075 place count 1772 transition count 1714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1076 place count 1772 transition count 1713
Renaming transitions due to excessive name length > 1024 char.
Discarding 236 places :
Symmetric choice reduction at 2 with 236 rule applications. Total rules 1312 place count 1536 transition count 1477
Deduced a syphon composed of 839 places in 1 ms
Iterating global reduction 2 with 236 rules applied. Total rules applied 1548 place count 1536 transition count 1477
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 840 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1549 place count 1536 transition count 1477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1551 place count 1534 transition count 1475
Deduced a syphon composed of 838 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1553 place count 1534 transition count 1475
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 939 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1654 place count 1534 transition count 2002
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 1756 place count 1432 transition count 1798
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 1858 place count 1432 transition count 1798
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 855 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1876 place count 1432 transition count 1897
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1894 place count 1414 transition count 1861
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1912 place count 1414 transition count 1861
Deduced a syphon composed of 837 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1921 place count 1414 transition count 1852
Deduced a syphon composed of 837 places in 1 ms
Applied a total of 1921 rules in 458 ms. Remains 1414 /1772 variables (removed 358) and now considering 1852/1622 (removed -230) transitions.
[2024-05-29 03:36:41] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1852 rows 1414 cols
[2024-05-29 03:36:41] [INFO ] Computed 271 invariants in 17 ms
[2024-05-29 03:36:42] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1414/1772 places, 1852/1622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1446 ms. Remains : 1414/1772 places, 1852/1622 transitions.
Built C files in :
/tmp/ltsmin5427343629271556704
[2024-05-29 03:36:42] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5427343629271556704
Running compilation step : cd /tmp/ltsmin5427343629271556704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2863 ms.
Running link step : cd /tmp/ltsmin5427343629271556704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5427343629271556704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17511635652532230790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Applied a total of 0 rules in 61 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2024-05-29 03:36:57] [INFO ] Computed 271 invariants in 10 ms
[2024-05-29 03:36:58] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-29 03:36:58] [INFO ] Invariant cache hit.
[2024-05-29 03:36:59] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2024-05-29 03:36:59] [INFO ] Invariant cache hit.
[2024-05-29 03:37:00] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3258 ms. Remains : 1772/1772 places, 1622/1622 transitions.
Built C files in :
/tmp/ltsmin13815971259684644404
[2024-05-29 03:37:01] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13815971259684644404
Running compilation step : cd /tmp/ltsmin13815971259684644404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2842 ms.
Running link step : cd /tmp/ltsmin13815971259684644404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13815971259684644404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11418375341327314750.hoa' '--buchi-type=spotba'
LTSmin run took 1599 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-11 finished in 83679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1777 transition count 1268
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 1418 transition count 1268
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 718 place count 1418 transition count 1029
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1196 place count 1179 transition count 1029
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1202 place count 1173 transition count 1023
Iterating global reduction 2 with 6 rules applied. Total rules applied 1208 place count 1173 transition count 1023
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1208 place count 1173 transition count 1020
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1214 place count 1170 transition count 1020
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 0 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2226 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2227 place count 664 transition count 513
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2229 place count 663 transition count 512
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2407 place count 574 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2409 place count 572 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2411 place count 570 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2411 place count 570 transition count 568
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2413 place count 569 transition count 568
Applied a total of 2413 rules in 168 ms. Remains 569 /1778 variables (removed 1209) and now considering 568/1628 (removed 1060) transitions.
// Phase 1: matrix 568 rows 569 cols
[2024-05-29 03:37:05] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:37:06] [INFO ] Implicit Places using invariants in 352 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 353 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 568/1778 places, 568/1628 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 567
Applied a total of 2 rules in 12 ms. Remains 567 /568 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 567 cols
[2024-05-29 03:37:06] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:37:06] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-29 03:37:06] [INFO ] Invariant cache hit.
[2024-05-29 03:37:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 03:37:07] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/1778 places, 567/1628 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1525 ms. Remains : 567/1778 places, 567/1628 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s212 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-13 finished in 1575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1777 transition count 1267
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1417 transition count 1267
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 720 place count 1417 transition count 1030
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1194 place count 1180 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1199 place count 1175 transition count 1025
Iterating global reduction 2 with 5 rules applied. Total rules applied 1204 place count 1175 transition count 1025
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1204 place count 1175 transition count 1022
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1210 place count 1172 transition count 1022
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2226 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2227 place count 664 transition count 513
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2229 place count 663 transition count 512
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2407 place count 574 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2409 place count 572 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2411 place count 570 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2411 place count 570 transition count 568
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2413 place count 569 transition count 568
Applied a total of 2413 rules in 184 ms. Remains 569 /1778 variables (removed 1209) and now considering 568/1628 (removed 1060) transitions.
// Phase 1: matrix 568 rows 569 cols
[2024-05-29 03:37:07] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:37:07] [INFO ] Implicit Places using invariants in 327 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 568/1778 places, 568/1628 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 567
Applied a total of 2 rules in 13 ms. Remains 567 /568 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 567 cols
[2024-05-29 03:37:07] [INFO ] Computed 268 invariants in 5 ms
[2024-05-29 03:37:07] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-29 03:37:07] [INFO ] Invariant cache hit.
[2024-05-29 03:37:08] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/1778 places, 567/1628 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1515 ms. Remains : 567/1778 places, 567/1628 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s72 0) (NEQ s377 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-14 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U !p1))'
Support contains 4 out of 1778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 1777 transition count 1271
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 1421 transition count 1271
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 712 place count 1421 transition count 1032
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1190 place count 1182 transition count 1032
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1195 place count 1177 transition count 1027
Iterating global reduction 2 with 5 rules applied. Total rules applied 1200 place count 1177 transition count 1027
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1200 place count 1177 transition count 1025
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1204 place count 1175 transition count 1025
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2216 place count 669 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2217 place count 669 transition count 518
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2219 place count 668 transition count 517
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2397 place count 579 transition count 576
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2398 place count 579 transition count 576
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2400 place count 577 transition count 574
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2402 place count 575 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2402 place count 575 transition count 573
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2404 place count 574 transition count 573
Applied a total of 2404 rules in 216 ms. Remains 574 /1778 variables (removed 1204) and now considering 573/1628 (removed 1055) transitions.
// Phase 1: matrix 573 rows 574 cols
[2024-05-29 03:37:08] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:37:09] [INFO ] Implicit Places using invariants in 311 ms returned [563]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 313 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 573/1778 places, 573/1628 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 572
Applied a total of 2 rules in 12 ms. Remains 572 /573 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 572 cols
[2024-05-29 03:37:09] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:37:09] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-29 03:37:09] [INFO ] Invariant cache hit.
[2024-05-29 03:37:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:37:10] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 572/1778 places, 572/1628 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1499 ms. Remains : 572/1778 places, 572/1628 transitions.
Stuttering acceptance computed with spot in 119 ms :[p1, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s92 0) (EQ s439 1)), p0:(OR (EQ s95 0) (EQ s234 1) (EQ s92 0) (EQ s439 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-15 finished in 1640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0 U (G(p0)||p1))))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-030B-LTLCardinality-03
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1778 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1777 transition count 1270
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1420 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1419 transition count 1269
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 716 place count 1419 transition count 1031
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1192 place count 1181 transition count 1031
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1196 place count 1177 transition count 1027
Iterating global reduction 3 with 4 rules applied. Total rules applied 1200 place count 1177 transition count 1027
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1200 place count 1177 transition count 1024
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1206 place count 1174 transition count 1024
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2220 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2221 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2223 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2401 place count 577 transition count 574
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2403 place count 575 transition count 572
Applied a total of 2403 rules in 250 ms. Remains 575 /1778 variables (removed 1203) and now considering 572/1628 (removed 1056) transitions.
// Phase 1: matrix 572 rows 575 cols
[2024-05-29 03:37:10] [INFO ] Computed 271 invariants in 1 ms
[2024-05-29 03:37:11] [INFO ] Implicit Places using invariants in 335 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 574/1778 places, 572/1628 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 571
Applied a total of 2 rules in 10 ms. Remains 573 /574 variables (removed 1) and now considering 571/572 (removed 1) transitions.
// Phase 1: matrix 571 rows 573 cols
[2024-05-29 03:37:11] [INFO ] Computed 270 invariants in 2 ms
[2024-05-29 03:37:11] [INFO ] Implicit Places using invariants in 319 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 572/1778 places, 571/1628 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 570
Applied a total of 2 rules in 13 ms. Remains 571 /572 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:37:11] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:37:11] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-29 03:37:11] [INFO ] Invariant cache hit.
[2024-05-29 03:37:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:37:12] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 571/1778 places, 570/1628 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 1885 ms. Remains : 571/1778 places, 570/1628 transitions.
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s557 0) (EQ s304 1)), p0:(OR (EQ s243 0) (EQ s292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 601 ms.
Product exploration explored 100000 steps with 20000 reset in 695 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/571 stabilizing places and 4/570 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:37:14] [INFO ] Invariant cache hit.
[2024-05-29 03:37:14] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:37:14] [INFO ] [Nat]Absence check using 269 positive place invariants in 42 ms returned sat
[2024-05-29 03:37:14] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:37:14] [INFO ] After 28ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:14] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 03:37:14] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 570/570 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 571 transition count 569
Applied a total of 1 rules in 9 ms. Remains 571 /571 variables (removed 0) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 571/571 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 353254 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353254 steps, saw 254541 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:37:17] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:37:17] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:37:17] [INFO ] [Nat]Absence check using 269 positive place invariants in 38 ms returned sat
[2024-05-29 03:37:18] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:37:18] [INFO ] After 41ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:37:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-29 03:37:18] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 03:37:18] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-29 03:37:18] [INFO ] Invariant cache hit.
[2024-05-29 03:37:18] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-29 03:37:18] [INFO ] Invariant cache hit.
[2024-05-29 03:37:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:37:19] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2024-05-29 03:37:19] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:37:19] [INFO ] Invariant cache hit.
[2024-05-29 03:37:19] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1260 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1403 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 13 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2024-05-29 03:37:19] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:37:19] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:37:19] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:37:20] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:37:20] [INFO ] After 27ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:20] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-29 03:37:20] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 570/570 transitions.
Applied a total of 0 rules in 9 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:37:20] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:37:21] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-29 03:37:21] [INFO ] Invariant cache hit.
[2024-05-29 03:37:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:37:21] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2024-05-29 03:37:21] [INFO ] Invariant cache hit.
[2024-05-29 03:37:22] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1325 ms. Remains : 571/571 places, 570/570 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/571 stabilizing places and 4/570 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:37:22] [INFO ] Invariant cache hit.
[2024-05-29 03:37:22] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:37:22] [INFO ] [Nat]Absence check using 269 positive place invariants in 39 ms returned sat
[2024-05-29 03:37:22] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:37:22] [INFO ] After 25ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:22] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 03:37:22] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 570/570 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 571 transition count 569
Applied a total of 1 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 571/571 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 348840 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348840 steps, saw 251437 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 571 cols
[2024-05-29 03:37:26] [INFO ] Computed 269 invariants in 3 ms
[2024-05-29 03:37:26] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:37:26] [INFO ] [Nat]Absence check using 269 positive place invariants in 39 ms returned sat
[2024-05-29 03:37:26] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:37:26] [INFO ] After 41ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:37:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-29 03:37:26] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 03:37:26] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-29 03:37:26] [INFO ] Invariant cache hit.
[2024-05-29 03:37:26] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-29 03:37:27] [INFO ] Invariant cache hit.
[2024-05-29 03:37:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 03:37:27] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2024-05-29 03:37:27] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:37:27] [INFO ] Invariant cache hit.
[2024-05-29 03:37:28] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1342 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1403 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 13 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2024-05-29 03:37:28] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:37:28] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:37:28] [INFO ] [Nat]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:37:28] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:37:28] [INFO ] After 33ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:37:28] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 03:37:28] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 611 ms.
Product exploration explored 100000 steps with 20000 reset in 729 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 570/570 transitions.
Applied a total of 0 rules in 10 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-29 03:37:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:37:30] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:37:31] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 571/571 places, 570/570 transitions.
Built C files in :
/tmp/ltsmin200239366621988666
[2024-05-29 03:37:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin200239366621988666
Running compilation step : cd /tmp/ltsmin200239366621988666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 955 ms.
Running link step : cd /tmp/ltsmin200239366621988666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin200239366621988666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11412233596592424869.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-03 finished in 22091 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-03 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-29 03:37:32] [INFO ] Flatten gal took : 36 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 375157 ms.

BK_STOP 1716953853581

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-030B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788700187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;