Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715100300.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 512K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679272040582

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:27:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:27:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:27:23] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-20 00:27:23] [INFO ] Transformed 2103 places.
[2023-03-20 00:27:23] [INFO ] Transformed 1953 transitions.
[2023-03-20 00:27:23] [INFO ] Found NUPN structural information;
[2023-03-20 00:27:23] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-030B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1783 transition count 1633
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1783 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 641 place count 1782 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 642 place count 1782 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 1781 transition count 1631
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 1781 transition count 1631
Applied a total of 644 rules in 864 ms. Remains 1781 /2103 variables (removed 322) and now considering 1631/1953 (removed 322) transitions.
// Phase 1: matrix 1631 rows 1781 cols
[2023-03-20 00:27:24] [INFO ] Computed 271 place invariants in 39 ms
[2023-03-20 00:27:25] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2023-03-20 00:27:25] [INFO ] Invariant cache hit.
[2023-03-20 00:27:27] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
[2023-03-20 00:27:27] [INFO ] Invariant cache hit.
[2023-03-20 00:27:28] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1781/2103 places, 1631/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5470 ms. Remains : 1781/2103 places, 1631/1953 transitions.
Support contains 33 out of 1781 places after structural reductions.
[2023-03-20 00:27:29] [INFO ] Flatten gal took : 134 ms
[2023-03-20 00:27:29] [INFO ] Flatten gal took : 61 ms
[2023-03-20 00:27:29] [INFO ] Input system was already deterministic with 1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 27) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-20 00:27:30] [INFO ] Invariant cache hit.
[2023-03-20 00:27:31] [INFO ] [Real]Absence check using 271 positive place invariants in 169 ms returned sat
[2023-03-20 00:27:31] [INFO ] After 807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 00:27:31] [INFO ] [Nat]Absence check using 271 positive place invariants in 155 ms returned sat
[2023-03-20 00:27:34] [INFO ] After 2362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 00:27:35] [INFO ] Deduced a trap composed of 19 places in 431 ms of which 7 ms to minimize.
[2023-03-20 00:27:35] [INFO ] Deduced a trap composed of 16 places in 297 ms of which 1 ms to minimize.
[2023-03-20 00:27:36] [INFO ] Deduced a trap composed of 20 places in 431 ms of which 2 ms to minimize.
[2023-03-20 00:27:36] [INFO ] Deduced a trap composed of 20 places in 405 ms of which 2 ms to minimize.
[2023-03-20 00:27:36] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 1 ms to minimize.
[2023-03-20 00:27:37] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2023-03-20 00:27:37] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 1 ms to minimize.
[2023-03-20 00:27:38] [INFO ] Deduced a trap composed of 27 places in 305 ms of which 2 ms to minimize.
[2023-03-20 00:27:38] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 0 ms to minimize.
[2023-03-20 00:27:38] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 1 ms to minimize.
[2023-03-20 00:27:39] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-20 00:27:39] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 3 ms to minimize.
[2023-03-20 00:27:39] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 1 ms to minimize.
[2023-03-20 00:27:40] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2023-03-20 00:27:40] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 1 ms to minimize.
[2023-03-20 00:27:40] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 0 ms to minimize.
[2023-03-20 00:27:40] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 1 ms to minimize.
[2023-03-20 00:27:41] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 2 ms to minimize.
[2023-03-20 00:27:41] [INFO ] Deduced a trap composed of 27 places in 350 ms of which 0 ms to minimize.
[2023-03-20 00:27:41] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 1 ms to minimize.
[2023-03-20 00:27:42] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 1 ms to minimize.
[2023-03-20 00:27:42] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 0 ms to minimize.
[2023-03-20 00:27:42] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 1 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 0 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 0 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 0 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 1 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 0 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 1 ms to minimize.
[2023-03-20 00:27:45] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 0 ms to minimize.
[2023-03-20 00:27:45] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 10455 ms
[2023-03-20 00:27:45] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 1 ms to minimize.
[2023-03-20 00:27:46] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 1 ms to minimize.
[2023-03-20 00:27:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 734 ms
[2023-03-20 00:27:46] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 0 ms to minimize.
[2023-03-20 00:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-20 00:27:46] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2023-03-20 00:27:47] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 0 ms to minimize.
[2023-03-20 00:27:47] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2023-03-20 00:27:47] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2023-03-20 00:27:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1081 ms
[2023-03-20 00:27:48] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 0 ms to minimize.
[2023-03-20 00:27:48] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2023-03-20 00:27:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 608 ms
[2023-03-20 00:27:49] [INFO ] After 17102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1234 ms.
[2023-03-20 00:27:50] [INFO ] After 19567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 855 ms.
Support contains 17 out of 1781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1781/1781 places, 1631/1631 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 1781 transition count 1275
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 1425 transition count 1275
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 712 place count 1425 transition count 1042
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1178 place count 1192 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1180 place count 1190 transition count 1040
Iterating global reduction 2 with 2 rules applied. Total rules applied 1182 place count 1190 transition count 1040
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1182 place count 1190 transition count 1038
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 1186 place count 1188 transition count 1038
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 2 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2200 place count 681 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2201 place count 681 transition count 530
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2203 place count 680 transition count 529
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 3 with 174 rules applied. Total rules applied 2377 place count 593 transition count 584
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2378 place count 593 transition count 583
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2381 place count 593 transition count 580
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2384 place count 590 transition count 580
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 2415 place count 590 transition count 580
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2416 place count 589 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2418 place count 587 transition count 579
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2418 place count 587 transition count 578
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2420 place count 586 transition count 578
Applied a total of 2420 rules in 500 ms. Remains 586 /1781 variables (removed 1195) and now considering 578/1631 (removed 1053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 586/1781 places, 578/1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 104743 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104743 steps, saw 66834 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 578 rows 586 cols
[2023-03-20 00:27:56] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:27:56] [INFO ] [Real]Absence check using 269 positive place invariants in 40 ms returned sat
[2023-03-20 00:27:56] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 00:27:56] [INFO ] [Nat]Absence check using 269 positive place invariants in 57 ms returned sat
[2023-03-20 00:27:57] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 00:27:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 00:27:58] [INFO ] After 364ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 00:27:59] [INFO ] After 1171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-20 00:27:59] [INFO ] After 2979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 16 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 578/578 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 585 transition count 577
Applied a total of 2 rules in 31 ms. Remains 585 /586 variables (removed 1) and now considering 577/578 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 585/586 places, 577/578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 100560 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100560 steps, saw 64215 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 577 rows 585 cols
[2023-03-20 00:28:03] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:28:04] [INFO ] [Real]Absence check using 269 positive place invariants in 122 ms returned sat
[2023-03-20 00:28:04] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:28:04] [INFO ] [Nat]Absence check using 269 positive place invariants in 125 ms returned sat
[2023-03-20 00:28:05] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 00:28:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 00:28:05] [INFO ] After 421ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 00:28:06] [INFO ] After 1153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 507 ms.
[2023-03-20 00:28:06] [INFO ] After 2787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 187 ms.
Support contains 15 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 577/577 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 584 transition count 576
Applied a total of 2 rules in 29 ms. Remains 584 /585 variables (removed 1) and now considering 576/577 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 584/585 places, 576/577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 576 rows 584 cols
[2023-03-20 00:28:07] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:28:08] [INFO ] [Real]Absence check using 269 positive place invariants in 34 ms returned sat
[2023-03-20 00:28:08] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 00:28:08] [INFO ] [Nat]Absence check using 269 positive place invariants in 48 ms returned sat
[2023-03-20 00:28:08] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 00:28:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 00:28:09] [INFO ] After 378ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 00:28:10] [INFO ] After 1055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-03-20 00:28:10] [INFO ] After 2330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 258 ms.
Support contains 14 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 576/576 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 583 transition count 575
Applied a total of 2 rules in 16 ms. Remains 583 /584 variables (removed 1) and now considering 575/576 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 583/584 places, 575/576 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 575 rows 583 cols
[2023-03-20 00:28:11] [INFO ] Computed 269 place invariants in 4 ms
[2023-03-20 00:28:11] [INFO ] [Real]Absence check using 269 positive place invariants in 152 ms returned sat
[2023-03-20 00:28:11] [INFO ] After 253ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-20 00:28:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 00:28:11] [INFO ] After 52ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:11] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:12] [INFO ] [Nat]Absence check using 269 positive place invariants in 69 ms returned sat
[2023-03-20 00:28:12] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:13] [INFO ] After 273ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:13] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-20 00:28:13] [INFO ] After 2007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 10 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 575/575 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 582 transition count 573
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 581 transition count 573
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 2 with 2 rules applied. Total rules applied 6 place count 580 transition count 572
Applied a total of 6 rules in 29 ms. Remains 580 /583 variables (removed 3) and now considering 572/575 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 580/583 places, 572/575 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 126309 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126309 steps, saw 80405 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 572 rows 580 cols
[2023-03-20 00:28:17] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:28:17] [INFO ] [Real]Absence check using 269 positive place invariants in 51 ms returned sat
[2023-03-20 00:28:18] [INFO ] After 250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-20 00:28:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 00:28:18] [INFO ] After 60ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:18] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:18] [INFO ] [Nat]Absence check using 269 positive place invariants in 68 ms returned sat
[2023-03-20 00:28:19] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:19] [INFO ] After 379ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:19] [INFO ] After 923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-20 00:28:20] [INFO ] After 2073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 10 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 572/572 transitions.
Applied a total of 0 rules in 10 ms. Remains 580 /580 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 580/580 places, 572/572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 572/572 transitions.
Applied a total of 0 rules in 9 ms. Remains 580 /580 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-20 00:28:20] [INFO ] Invariant cache hit.
[2023-03-20 00:28:20] [INFO ] Implicit Places using invariants in 369 ms returned [569]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 579/580 places, 572/572 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 578 transition count 571
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 578 transition count 571
Applied a total of 2 rules in 15 ms. Remains 578 /579 variables (removed 1) and now considering 571/572 (removed 1) transitions.
// Phase 1: matrix 571 rows 578 cols
[2023-03-20 00:28:20] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:28:21] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-20 00:28:21] [INFO ] Invariant cache hit.
[2023-03-20 00:28:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:28:21] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 578/580 places, 571/572 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1467 ms. Remains : 578/580 places, 571/572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 116414 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116414 steps, saw 74768 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-20 00:28:25] [INFO ] Invariant cache hit.
[2023-03-20 00:28:25] [INFO ] [Real]Absence check using 268 positive place invariants in 118 ms returned sat
[2023-03-20 00:28:25] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-20 00:28:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:28:25] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:25] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:26] [INFO ] [Nat]Absence check using 268 positive place invariants in 53 ms returned sat
[2023-03-20 00:28:26] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:27] [INFO ] After 235ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:27] [INFO ] After 734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-20 00:28:27] [INFO ] After 1901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 190 ms.
Support contains 10 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 571/571 transitions.
Applied a total of 0 rules in 11 ms. Remains 578 /578 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 578/578 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 571/571 transitions.
Applied a total of 0 rules in 9 ms. Remains 578 /578 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-20 00:28:28] [INFO ] Invariant cache hit.
[2023-03-20 00:28:28] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-20 00:28:28] [INFO ] Invariant cache hit.
[2023-03-20 00:28:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:28:29] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2023-03-20 00:28:29] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-20 00:28:29] [INFO ] Invariant cache hit.
[2023-03-20 00:28:30] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1945 ms. Remains : 578/578 places, 571/571 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 578 transition count 571
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 578 transition count 570
Applied a total of 62 rules in 30 ms. Remains 578 /578 variables (removed 0) and now considering 570/571 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 570 rows 578 cols
[2023-03-20 00:28:30] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:28:30] [INFO ] [Real]Absence check using 268 positive place invariants in 42 ms returned sat
[2023-03-20 00:28:30] [INFO ] After 198ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-20 00:28:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-20 00:28:30] [INFO ] After 94ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:30] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:28:30] [INFO ] [Nat]Absence check using 268 positive place invariants in 63 ms returned sat
[2023-03-20 00:28:31] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:31] [INFO ] After 303ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:28:32] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-03-20 00:28:32] [INFO ] After 1839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(p0)&&G(p1)))))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 136 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-20 00:28:33] [INFO ] Computed 271 place invariants in 13 ms
[2023-03-20 00:28:33] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-20 00:28:33] [INFO ] Invariant cache hit.
[2023-03-20 00:28:35] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2023-03-20 00:28:35] [INFO ] Invariant cache hit.
[2023-03-20 00:28:36] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3678 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 594 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(EQ s240 1), p0:(AND (EQ s1214 1) (EQ s1295 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-00 finished in 4370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 283 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-20 00:28:37] [INFO ] Computed 271 place invariants in 13 ms
[2023-03-20 00:28:38] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-20 00:28:38] [INFO ] Invariant cache hit.
[2023-03-20 00:28:40] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2575 ms to find 0 implicit places.
[2023-03-20 00:28:40] [INFO ] Invariant cache hit.
[2023-03-20 00:28:41] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3949 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s233 1), p0:(EQ s966 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 779 ms.
Stack based approach found an accepted trace after 2471 steps with 0 reset with depth 2472 and stack size 2472 in 16 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-01 finished in 5138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))&&X(G(p2))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 144 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-20 00:28:42] [INFO ] Computed 271 place invariants in 7 ms
[2023-03-20 00:28:43] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-03-20 00:28:43] [INFO ] Invariant cache hit.
[2023-03-20 00:28:45] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2413 ms to find 0 implicit places.
[2023-03-20 00:28:45] [INFO ] Invariant cache hit.
[2023-03-20 00:28:46] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3647 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (EQ s1512 1) (NEQ s1141 1)), p2:(EQ s1141 0), p1:(EQ s1512 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-04 finished in 3923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 158 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2023-03-20 00:28:46] [INFO ] Invariant cache hit.
[2023-03-20 00:28:47] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-20 00:28:47] [INFO ] Invariant cache hit.
[2023-03-20 00:28:49] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2023-03-20 00:28:49] [INFO ] Invariant cache hit.
[2023-03-20 00:28:50] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3679 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-05 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:(AND (EQ s1547 0) (EQ s547 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-05 finished in 3797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)&&(p2||F(p3))))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 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 1780 transition count 1270
Reduce places removed 360 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 361 rules applied. Total rules applied 721 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 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1193 place count 1181 transition count 1031
Iterating global reduction 3 with 5 rules applied. Total rules applied 1198 place count 1181 transition count 1031
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1198 place count 1181 transition count 1026
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1208 place count 1176 transition count 1026
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 0 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1022 rules applied. Total rules applied 2230 place count 665 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 665 transition count 514
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 2233 place count 664 transition count 513
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2407 place count 577 transition count 568
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2409 place count 575 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2411 place count 573 transition count 566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2411 place count 573 transition count 565
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 2413 place count 572 transition count 565
Applied a total of 2413 rules in 327 ms. Remains 572 /1781 variables (removed 1209) and now considering 565/1631 (removed 1066) transitions.
// Phase 1: matrix 565 rows 572 cols
[2023-03-20 00:28:50] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:28:51] [INFO ] Implicit Places using invariants in 665 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 666 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1781 places, 565/1631 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 570 transition count 564
Applied a total of 2 rules in 19 ms. Remains 570 /571 variables (removed 1) and now considering 564/565 (removed 1) transitions.
// Phase 1: matrix 564 rows 570 cols
[2023-03-20 00:28:51] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:28:51] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-20 00:28:51] [INFO ] Invariant cache hit.
[2023-03-20 00:28:52] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1781 places, 564/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2512 ms. Remains : 570/1781 places, 564/1631 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s133 1), p0:(EQ s538 1), p2:(EQ s538 0), p3:(EQ s211 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-06 finished in 2874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 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 1780 transition count 1270
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1420 transition count 1270
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 720 place count 1420 transition count 1036
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1192 place count 1182 transition count 1032
Iterating global reduction 2 with 4 rules applied. Total rules applied 1196 place count 1182 transition count 1032
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1196 place count 1182 transition count 1028
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1204 place count 1178 transition count 1028
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2226 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 2227 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 2229 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 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2407 place count 577 transition count 573
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 577 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2410 place count 575 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2412 place count 573 transition count 571
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 573 transition count 570
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 2414 place count 572 transition count 570
Applied a total of 2414 rules in 292 ms. Remains 572 /1781 variables (removed 1209) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 572 cols
[2023-03-20 00:28:53] [INFO ] Computed 269 place invariants in 4 ms
[2023-03-20 00:28:53] [INFO ] Implicit Places using invariants in 371 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1781 places, 570/1631 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 570 transition count 569
Applied a total of 2 rules in 28 ms. Remains 570 /571 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 570 cols
[2023-03-20 00:28:53] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:28:54] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-20 00:28:54] [INFO ] Invariant cache hit.
[2023-03-20 00:28:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:28:54] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1871 ms. Remains : 570/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s209 0) (EQ s74 0)), p0:(OR (EQ s74 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-07 finished in 2218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 362 rules applied. Total rules applied 723 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 724 place count 1418 transition count 1268
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 724 place count 1418 transition count 1036
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 3 with 464 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1195 place count 1179 transition count 1029
Iterating global reduction 3 with 7 rules applied. Total rules applied 1202 place count 1179 transition count 1029
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1202 place count 1179 transition count 1023
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1214 place count 1173 transition count 1023
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 2228 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 2229 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 2231 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 2409 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2413 place count 572 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 2413 place count 572 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 2415 place count 571 transition count 570
Applied a total of 2415 rules in 348 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-20 00:28:55] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-20 00:28:56] [INFO ] Implicit Places using invariants in 398 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 399 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 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 569 transition count 569
Applied a total of 2 rules in 13 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-20 00:28:56] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:28:56] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-20 00:28:56] [INFO ] Invariant cache hit.
[2023-03-20 00:28:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:28:57] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1966 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s202 0) (EQ s209 0) (EQ s212 0)), p0:(EQ s550 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21522 reset in 722 ms.
Product exploration explored 100000 steps with 21423 reset in 914 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/569 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 333 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 6442 steps, including 1 resets, run visited all 2 properties in 72 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 369 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-20 00:29:00] [INFO ] Invariant cache hit.
[2023-03-20 00:29:00] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-20 00:29:00] [INFO ] Invariant cache hit.
[2023-03-20 00:29:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:29:00] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2023-03-20 00:29:00] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 00:29:00] [INFO ] Invariant cache hit.
[2023-03-20 00:29:01] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1276 ms. Remains : 569/569 places, 569/569 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/569 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 353 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:29:01] [INFO ] Invariant cache hit.
[2023-03-20 00:29:01] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:02] [INFO ] [Nat]Absence check using 268 positive place invariants in 42 ms returned sat
[2023-03-20 00:29:02] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:29:02] [INFO ] After 25ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:02] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-20 00:29:02] [INFO ] After 509ms 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 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 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 569 transition count 568
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 569 transition count 568
Applied a total of 2 rules in 37 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 355732 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355732 steps, saw 227763 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-20 00:29:05] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:29:05] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:05] [INFO ] [Nat]Absence check using 268 positive place invariants in 36 ms returned sat
[2023-03-20 00:29:06] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:29:06] [INFO ] After 27ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:06] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 00:29:06] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 17 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 14 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-20 00:29:06] [INFO ] Invariant cache hit.
[2023-03-20 00:29:06] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-20 00:29:06] [INFO ] Invariant cache hit.
[2023-03-20 00:29:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:29:07] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2023-03-20 00:29:07] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-20 00:29:07] [INFO ] Invariant cache hit.
[2023-03-20 00:29:07] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1651 ms. Remains : 569/569 places, 568/568 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 569 transition count 568
Applied a total of 62 rules in 17 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-20 00:29:07] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:29:08] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:08] [INFO ] [Nat]Absence check using 268 positive place invariants in 42 ms returned sat
[2023-03-20 00:29:08] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 00:29:08] [INFO ] After 57ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:08] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 00:29:08] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 554 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21498 reset in 739 ms.
Product exploration explored 100000 steps with 21685 reset in 768 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-20 00:29:11] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:29:11] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-20 00:29:11] [INFO ] Invariant cache hit.
[2023-03-20 00:29:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:29:12] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
[2023-03-20 00:29:12] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-20 00:29:12] [INFO ] Invariant cache hit.
[2023-03-20 00:29:12] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1864 ms. Remains : 569/569 places, 569/569 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-08 finished in 17652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&G(p1))||G(!p0)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 722 place count 1419 transition count 1035
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1190 place count 1185 transition count 1035
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1196 place count 1179 transition count 1029
Iterating global reduction 2 with 6 rules applied. Total rules applied 1202 place count 1179 transition count 1029
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1202 place count 1179 transition count 1024
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1212 place count 1174 transition count 1024
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 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 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 3 with 2 rules applied. Total rules applied 2231 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 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2410 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2412 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2414 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2414 place count 572 transition count 570
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 2416 place count 571 transition count 570
Applied a total of 2416 rules in 247 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-20 00:29:13] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:29:13] [INFO ] Implicit Places using invariants in 284 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 285 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 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 569 transition count 569
Applied a total of 2 rules in 14 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-20 00:29:13] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:29:13] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-20 00:29:13] [INFO ] Invariant cache hit.
[2023-03-20 00:29:15] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2015 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 303 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s207 1), p0:(AND (EQ s196 1) (EQ s206 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 633 ms.
Product exploration explored 100000 steps with 0 reset in 729 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 p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 699 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 162044 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 162044 steps, saw 100269 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 00:29:21] [INFO ] Invariant cache hit.
[2023-03-20 00:29:21] [INFO ] [Real]Absence check using 268 positive place invariants in 34 ms returned sat
[2023-03-20 00:29:21] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-20 00:29:21] [INFO ] After 246ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:21] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:22] [INFO ] [Nat]Absence check using 268 positive place invariants in 49 ms returned sat
[2023-03-20 00:29:22] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:29:23] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 229 ms.
[2023-03-20 00:29:23] [INFO ] After 1362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 69 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 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 569 transition count 568
Applied a total of 1 rules in 14 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 149427 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149427 steps, saw 93973 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-20 00:29:26] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:29:27] [INFO ] [Real]Absence check using 268 positive place invariants in 31 ms returned sat
[2023-03-20 00:29:27] [INFO ] After 200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-20 00:29:27] [INFO ] After 242ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:27] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:27] [INFO ] [Nat]Absence check using 268 positive place invariants in 141 ms returned sat
[2023-03-20 00:29:28] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:29:28] [INFO ] After 855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-20 00:29:28] [INFO ] After 1505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 7 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-20 00:29:28] [INFO ] Invariant cache hit.
[2023-03-20 00:29:29] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-20 00:29:29] [INFO ] Invariant cache hit.
[2023-03-20 00:29:30] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
[2023-03-20 00:29:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:29:30] [INFO ] Invariant cache hit.
[2023-03-20 00:29:30] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1819 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 569 transition count 568
Applied a total of 59 rules in 17 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-20 00:29:30] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:29:30] [INFO ] [Real]Absence check using 268 positive place invariants in 31 ms returned sat
[2023-03-20 00:29:31] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:31] [INFO ] [Nat]Absence check using 268 positive place invariants in 49 ms returned sat
[2023-03-20 00:29:31] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:29:32] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-20 00:29:32] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 726 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 235 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 20 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-20 00:29:33] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:29:34] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-20 00:29:34] [INFO ] Invariant cache hit.
[2023-03-20 00:29:34] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-20 00:29:34] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:29:34] [INFO ] Invariant cache hit.
[2023-03-20 00:29:35] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1270 ms. Remains : 569/569 places, 569/569 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 p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 695 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 154432 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154432 steps, saw 95349 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 00:29:39] [INFO ] Invariant cache hit.
[2023-03-20 00:29:39] [INFO ] [Real]Absence check using 268 positive place invariants in 27 ms returned sat
[2023-03-20 00:29:40] [INFO ] After 189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-20 00:29:40] [INFO ] After 262ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:40] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:40] [INFO ] [Nat]Absence check using 268 positive place invariants in 63 ms returned sat
[2023-03-20 00:29:40] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:29:41] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-20 00:29:41] [INFO ] After 1125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 70 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 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 569 transition count 568
Applied a total of 1 rules in 13 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 133527 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133527 steps, saw 83987 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-20 00:29:45] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:29:45] [INFO ] [Real]Absence check using 268 positive place invariants in 59 ms returned sat
[2023-03-20 00:29:45] [INFO ] After 248ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-20 00:29:45] [INFO ] After 319ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:45] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:45] [INFO ] [Nat]Absence check using 268 positive place invariants in 199 ms returned sat
[2023-03-20 00:29:46] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:29:46] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-20 00:29:47] [INFO ] After 1569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 22 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 25 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-20 00:29:47] [INFO ] Invariant cache hit.
[2023-03-20 00:29:47] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-20 00:29:47] [INFO ] Invariant cache hit.
[2023-03-20 00:29:48] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2023-03-20 00:29:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:29:48] [INFO ] Invariant cache hit.
[2023-03-20 00:29:48] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1512 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 569 transition count 568
Applied a total of 59 rules in 16 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-20 00:29:48] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:29:48] [INFO ] [Real]Absence check using 268 positive place invariants in 37 ms returned sat
[2023-03-20 00:29:49] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:29:49] [INFO ] [Nat]Absence check using 268 positive place invariants in 254 ms returned sat
[2023-03-20 00:29:50] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:29:50] [INFO ] After 700ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-20 00:29:50] [INFO ] After 1407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 502 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 207 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 285 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 0 reset in 618 ms.
Stuttering criterion allowed to conclude after 97594 steps with 0 reset in 790 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-09 finished in 40286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 131 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-20 00:29:53] [INFO ] Computed 271 place invariants in 5 ms
[2023-03-20 00:29:54] [INFO ] Implicit Places using invariants in 621 ms returned []
[2023-03-20 00:29:54] [INFO ] Invariant cache hit.
[2023-03-20 00:29:55] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
[2023-03-20 00:29:55] [INFO ] Invariant cache hit.
[2023-03-20 00:29:56] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3474 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s1585 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-10 finished in 3663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1780 transition count 1268
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1418 transition count 1268
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 724 place count 1418 transition count 1035
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1190 place count 1185 transition count 1035
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1195 place count 1180 transition count 1030
Iterating global reduction 2 with 5 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1025
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1210 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 2 with 1018 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 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 3 with 2 rules applied. Total rules applied 2231 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 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2413 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 570
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 2415 place count 571 transition count 570
Applied a total of 2415 rules in 291 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-20 00:29:57] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-20 00:29:57] [INFO ] Implicit Places using invariants in 373 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 33 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-20 00:29:57] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:29:58] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-20 00:29:58] [INFO ] Invariant cache hit.
[2023-03-20 00:29:58] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1812 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s115 1)), p1:(NEQ s286 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16058 steps with 2 reset in 114 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-11 finished in 2021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 170 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-20 00:29:59] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-20 00:29:59] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-20 00:29:59] [INFO ] Invariant cache hit.
[2023-03-20 00:30:01] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 2665 ms to find 0 implicit places.
[2023-03-20 00:30:01] [INFO ] Invariant cache hit.
[2023-03-20 00:30:02] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3869 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1666 1) (EQ s1711 1)), p1:(AND (OR (NEQ s1666 1) (NEQ s1711 1)) (EQ s1361 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 174 reset in 556 ms.
Product exploration explored 100000 steps with 175 reset in 576 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1281 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 523 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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 118 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2023-03-20 00:30:05] [INFO ] Invariant cache hit.
[2023-03-20 00:30:06] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-20 00:30:06] [INFO ] Invariant cache hit.
[2023-03-20 00:30:08] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2589 ms to find 0 implicit places.
[2023-03-20 00:30:08] [INFO ] Invariant cache hit.
[2023-03-20 00:30:09] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3666 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4627 steps, including 1 resets, run visited all 3 properties in 50 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 474 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 169 reset in 486 ms.
Product exploration explored 100000 steps with 172 reset in 641 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1772/1772 places, 1622/1622 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 1772 transition count 1622
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 358 place count 1772 transition count 1713
Deduced a syphon composed of 479 places in 2 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 479 place count 1772 transition count 1713
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1077 places in 1 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1077 place count 1772 transition count 1713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1078 place count 1772 transition count 1712
Renaming transitions due to excessive name length > 1024 char.
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 1318 place count 1532 transition count 1472
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 2 with 240 rules applied. Total rules applied 1558 place count 1532 transition count 1472
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 1559 place count 1532 transition count 1472
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1561 place count 1530 transition count 1470
Deduced a syphon composed of 836 places in 7 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1563 place count 1530 transition count 1470
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -523
Deduced a syphon composed of 937 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1664 place count 1530 transition count 1993
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1765 place count 1429 transition count 1791
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1866 place count 1429 transition count 1791
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 853 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1883 place count 1429 transition count 1888
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1900 place count 1412 transition count 1854
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1917 place count 1412 transition count 1854
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 1926 place count 1412 transition count 1845
Deduced a syphon composed of 836 places in 2 ms
Applied a total of 1926 rules in 954 ms. Remains 1412 /1772 variables (removed 360) and now considering 1845/1622 (removed -223) transitions.
[2023-03-20 00:30:13] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 1845 rows 1412 cols
[2023-03-20 00:30:13] [INFO ] Computed 271 place invariants in 14 ms
[2023-03-20 00:30:14] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1412/1772 places, 1845/1622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1932 ms. Remains : 1412/1772 places, 1845/1622 transitions.
Support contains 3 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 87 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-20 00:30:14] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-20 00:30:15] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-20 00:30:15] [INFO ] Invariant cache hit.
[2023-03-20 00:30:17] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
[2023-03-20 00:30:17] [INFO ] Invariant cache hit.
[2023-03-20 00:30:18] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3611 ms. Remains : 1772/1772 places, 1622/1622 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-12 finished in 19231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1193 place count 1181 transition count 1031
Iterating global reduction 2 with 5 rules applied. Total rules applied 1198 place count 1181 transition count 1031
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1198 place count 1181 transition count 1026
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1208 place count 1176 transition count 1026
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2230 place count 665 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2231 place count 665 transition count 514
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 2233 place count 664 transition count 513
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2409 place count 576 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2411 place count 574 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2413 place count 572 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 2413 place count 572 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 2415 place count 571 transition count 568
Applied a total of 2415 rules in 298 ms. Remains 571 /1781 variables (removed 1210) and now considering 568/1631 (removed 1063) transitions.
// Phase 1: matrix 568 rows 571 cols
[2023-03-20 00:30:18] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-20 00:30:18] [INFO ] Implicit Places using invariants in 296 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 297 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 568/1631 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 569 transition count 567
Applied a total of 2 rules in 19 ms. Remains 569 /570 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 569 cols
[2023-03-20 00:30:18] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:30:19] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-20 00:30:19] [INFO ] Invariant cache hit.
[2023-03-20 00:30:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:30:19] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 567/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1691 ms. Remains : 569/1781 places, 567/1631 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s400 1), p0:(EQ s568 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 832 ms.
Product exploration explored 100000 steps with 50000 reset in 852 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 2245 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 447 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-20 00:30:22] [INFO ] Invariant cache hit.
[2023-03-20 00:30:23] [INFO ] [Real]Absence check using 268 positive place invariants in 160 ms returned sat
[2023-03-20 00:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:30:23] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2023-03-20 00:30:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:30:24] [INFO ] [Nat]Absence check using 268 positive place invariants in 103 ms returned sat
[2023-03-20 00:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:30:24] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-20 00:30:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:30:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 24 ms returned sat
[2023-03-20 00:30:25] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2023-03-20 00:30:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-20 00:30:25] [INFO ] Computed and/alt/rep : 566/868/566 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-20 00:30:38] [INFO ] Added : 518 causal constraints over 105 iterations in 13799 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 25 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-20 00:30:39] [INFO ] Invariant cache hit.
[2023-03-20 00:30:39] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-20 00:30:39] [INFO ] Invariant cache hit.
[2023-03-20 00:30:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:30:40] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2023-03-20 00:30:40] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 00:30:40] [INFO ] Invariant cache hit.
[2023-03-20 00:30:40] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1456 ms. Remains : 569/569 places, 567/567 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 511 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 390 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-20 00:30:41] [INFO ] Invariant cache hit.
[2023-03-20 00:30:41] [INFO ] [Real]Absence check using 268 positive place invariants in 108 ms returned sat
[2023-03-20 00:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:30:42] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2023-03-20 00:30:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:30:43] [INFO ] [Nat]Absence check using 268 positive place invariants in 125 ms returned sat
[2023-03-20 00:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:30:43] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2023-03-20 00:30:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:30:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2023-03-20 00:30:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-20 00:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-20 00:30:44] [INFO ] Computed and/alt/rep : 566/868/566 causal constraints (skipped 0 transitions) in 56 ms.
[2023-03-20 00:30:57] [INFO ] Added : 518 causal constraints over 105 iterations in 13429 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 830 ms.
Product exploration explored 100000 steps with 50000 reset in 881 ms.
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 9 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-20 00:30:59] [INFO ] Invariant cache hit.
[2023-03-20 00:30:59] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-20 00:30:59] [INFO ] Invariant cache hit.
[2023-03-20 00:31:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:31:00] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2023-03-20 00:31:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:31:00] [INFO ] Invariant cache hit.
[2023-03-20 00:31:00] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1659 ms. Remains : 569/569 places, 567/567 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-14 finished in 42850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 173 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-20 00:31:01] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-20 00:31:01] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-20 00:31:01] [INFO ] Invariant cache hit.
[2023-03-20 00:31:03] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2023-03-20 00:31:03] [INFO ] Invariant cache hit.
[2023-03-20 00:31:04] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3434 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s751 1), p0:(NEQ s867 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 578 ms.
Stack based approach found an accepted trace after 1446 steps with 0 reset with depth 1447 and stack size 1447 in 8 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-15 finished in 4184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Found a Shortening insensitive property : ShieldIIPt-PT-030B-LTLFireability-12
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1194 place count 1180 transition count 1030
Iterating global reduction 2 with 6 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1024
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1212 place count 1174 transition count 1024
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 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 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2407 place count 577 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 575 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 573 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 573 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 2413 place count 572 transition count 568
Applied a total of 2413 rules in 320 ms. Remains 572 /1781 variables (removed 1209) and now considering 568/1631 (removed 1063) transitions.
// Phase 1: matrix 568 rows 572 cols
[2023-03-20 00:31:05] [INFO ] Computed 269 place invariants in 14 ms
[2023-03-20 00:31:06] [INFO ] Implicit Places using invariants in 524 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 526 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 571/1781 places, 568/1631 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 570 transition count 567
Applied a total of 2 rules in 16 ms. Remains 570 /571 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 570 cols
[2023-03-20 00:31:06] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:31:06] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-20 00:31:06] [INFO ] Invariant cache hit.
[2023-03-20 00:31:07] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 570/1781 places, 567/1631 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1808 ms. Remains : 570/1781 places, 567/1631 transitions.
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s537 1) (EQ s556 1)), p1:(AND (OR (NEQ s537 1) (NEQ s556 1)) (EQ s438 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 911 steps with 43 reset in 10 ms.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-12 finished in 2074 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
[2023-03-20 00:31:07] [INFO ] Flatten gal took : 132 ms
[2023-03-20 00:31:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 00:31:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1781 places, 1631 transitions and 4222 arcs took 25 ms.
Total runtime 225015 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-030B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLFireability

FORMULA ShieldIIPt-PT-030B-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-LTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679272303724

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPt-PT-030B-LTLFireability-14
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ShieldIIPt-PT-030B-LTLFireability-14
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-030B-LTLFireability-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldIIPt-PT-030B-LTLFireability-08
lola: result : true
lola: markings : 220
lola: fired transitions : 320
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPt-PT-030B-LTLFireability-12
lola: time limit : 3598 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/3598 7/32 ShieldIIPt-PT-030B-LTLFireability-12 190468 m, 38093 m/sec, 518883 t fired, .

Time elapsed: 6 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/3598 12/32 ShieldIIPt-PT-030B-LTLFireability-12 365002 m, 34906 m/sec, 1069440 t fired, .

Time elapsed: 11 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/3598 16/32 ShieldIIPt-PT-030B-LTLFireability-12 525952 m, 32190 m/sec, 1616190 t fired, .

Time elapsed: 16 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/3598 21/32 ShieldIIPt-PT-030B-LTLFireability-12 691165 m, 33042 m/sec, 2164457 t fired, .

Time elapsed: 21 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/3598 25/32 ShieldIIPt-PT-030B-LTLFireability-12 836536 m, 29074 m/sec, 2714753 t fired, .

Time elapsed: 26 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/3598 29/32 ShieldIIPt-PT-030B-LTLFireability-12 989324 m, 30557 m/sec, 3260521 t fired, .

Time elapsed: 31 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for ShieldIIPt-PT-030B-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLFireability-08: LTL true LTL model checker
ShieldIIPt-PT-030B-LTLFireability-12: LTL unknown AGGR
ShieldIIPt-PT-030B-LTLFireability-14: LTL true LTL model checker


Time elapsed: 36 secs. Pages in use: 32

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="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715100300"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;