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-167903715100299.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100299
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679272037352

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=LTLCardinality
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:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:27:20] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2023-03-20 00:27:20] [INFO ] Transformed 2103 places.
[2023-03-20 00:27:20] [INFO ] Transformed 1953 transitions.
[2023-03-20 00:27:20] [INFO ] Found NUPN structural information;
[2023-03-20 00:27:20] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 322 places :
Symmetric choice reduction at 0 with 322 rule applications. Total rules 322 place count 1781 transition count 1631
Iterating global reduction 0 with 322 rules applied. Total rules applied 644 place count 1781 transition count 1631
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 1780 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 1780 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 1779 transition count 1629
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 1779 transition count 1629
Applied a total of 648 rules in 875 ms. Remains 1779 /2103 variables (removed 324) and now considering 1629/1953 (removed 324) transitions.
// Phase 1: matrix 1629 rows 1779 cols
[2023-03-20 00:27:21] [INFO ] Computed 271 place invariants in 31 ms
[2023-03-20 00:27:22] [INFO ] Implicit Places using invariants in 1332 ms returned []
[2023-03-20 00:27:22] [INFO ] Invariant cache hit.
[2023-03-20 00:27:24] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 3546 ms to find 0 implicit places.
[2023-03-20 00:27:24] [INFO ] Invariant cache hit.
[2023-03-20 00:27:25] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1779/2103 places, 1629/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5484 ms. Remains : 1779/2103 places, 1629/1953 transitions.
Support contains 25 out of 1779 places after structural reductions.
[2023-03-20 00:27:26] [INFO ] Flatten gal took : 190 ms
[2023-03-20 00:27:26] [INFO ] Flatten gal took : 88 ms
[2023-03-20 00:27:26] [INFO ] Input system was already deterministic with 1629 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-20 00:27:27] [INFO ] Invariant cache hit.
[2023-03-20 00:27:28] [INFO ] After 637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 00:27:29] [INFO ] [Nat]Absence check using 271 positive place invariants in 159 ms returned sat
[2023-03-20 00:27:32] [INFO ] After 2033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 00:27:32] [INFO ] Deduced a trap composed of 24 places in 557 ms of which 6 ms to minimize.
[2023-03-20 00:27:33] [INFO ] Deduced a trap composed of 18 places in 348 ms of which 1 ms to minimize.
[2023-03-20 00:27:33] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 2 ms to minimize.
[2023-03-20 00:27:34] [INFO ] Deduced a trap composed of 19 places in 350 ms of which 1 ms to minimize.
[2023-03-20 00:27:34] [INFO ] Deduced a trap composed of 26 places in 446 ms of which 16 ms to minimize.
[2023-03-20 00:27:34] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 2 ms to minimize.
[2023-03-20 00:27:35] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 15 ms to minimize.
[2023-03-20 00:27:35] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 0 ms to minimize.
[2023-03-20 00:27:36] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 12 ms to minimize.
[2023-03-20 00:27:36] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2023-03-20 00:27:36] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 1 ms to minimize.
[2023-03-20 00:27:37] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 14 ms to minimize.
[2023-03-20 00:27:37] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 1 ms to minimize.
[2023-03-20 00:27:37] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 0 ms to minimize.
[2023-03-20 00:27:38] [INFO ] Deduced a trap composed of 34 places in 376 ms of which 1 ms to minimize.
[2023-03-20 00:27:38] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 0 ms to minimize.
[2023-03-20 00:27:39] [INFO ] Deduced a trap composed of 34 places in 318 ms of which 1 ms to minimize.
[2023-03-20 00:27:39] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 0 ms to minimize.
[2023-03-20 00:27:39] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2023-03-20 00:27:39] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 1 ms to minimize.
[2023-03-20 00:27:40] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2023-03-20 00:27:40] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 1 ms to minimize.
[2023-03-20 00:27:40] [INFO ] Deduced a trap composed of 41 places in 314 ms of which 0 ms to minimize.
[2023-03-20 00:27:41] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 1 ms to minimize.
[2023-03-20 00:27:41] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 0 ms to minimize.
[2023-03-20 00:27:41] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 1 ms to minimize.
[2023-03-20 00:27:41] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 1 ms to minimize.
[2023-03-20 00:27:42] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 1 ms to minimize.
[2023-03-20 00:27:42] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 1 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 0 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 1 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 1 ms to minimize.
[2023-03-20 00:27:43] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 1 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 1 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 1 ms to minimize.
[2023-03-20 00:27:44] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 12854 ms
[2023-03-20 00:27:45] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 0 ms to minimize.
[2023-03-20 00:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2023-03-20 00:27:46] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 1 ms to minimize.
[2023-03-20 00:27:46] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 1 ms to minimize.
[2023-03-20 00:27:46] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-20 00:27:46] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 0 ms to minimize.
[2023-03-20 00:27:47] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 13 ms to minimize.
[2023-03-20 00:27:47] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2023-03-20 00:27:48] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 1 ms to minimize.
[2023-03-20 00:27:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2403 ms
[2023-03-20 00:27:48] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 0 ms to minimize.
[2023-03-20 00:27:49] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 2 ms to minimize.
[2023-03-20 00:27:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 569 ms
[2023-03-20 00:27:49] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-20 00:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-20 00:27:50] [INFO ] After 20110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1198 ms.
[2023-03-20 00:27:51] [INFO ] After 22948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 859 ms.
Support contains 19 out of 1779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 1779 transition count 1282
Reduce places removed 347 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 350 rules applied. Total rules applied 697 place count 1432 transition count 1279
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 700 place count 1429 transition count 1279
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 700 place count 1429 transition count 1044
Deduced a syphon composed of 235 places in 4 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1170 place count 1194 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1172 place count 1192 transition count 1042
Iterating global reduction 3 with 2 rules applied. Total rules applied 1174 place count 1192 transition count 1042
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1174 place count 1192 transition count 1041
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 1176 place count 1191 transition count 1041
Performed 513 Post agglomeration using F-continuation condition.Transition count delta: 513
Deduced a syphon composed of 513 places in 2 ms
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 3 with 1026 rules applied. Total rules applied 2202 place count 678 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2203 place count 678 transition count 527
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 2205 place count 677 transition count 526
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 2375 place count 592 transition count 575
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2376 place count 592 transition count 574
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2378 place count 592 transition count 572
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2380 place count 590 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 2409 place count 590 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2410 place count 589 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2412 place count 587 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2412 place count 587 transition count 570
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2414 place count 586 transition count 570
Applied a total of 2414 rules in 431 ms. Remains 586 /1779 variables (removed 1193) and now considering 570/1629 (removed 1059) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 586/1779 places, 570/1629 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 570 rows 586 cols
[2023-03-20 00:27:53] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-20 00:27:53] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:27:53] [INFO ] [Nat]Absence check using 269 positive place invariants in 87 ms returned sat
[2023-03-20 00:27:54] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:27:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:27:54] [INFO ] After 194ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:27:54] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-20 00:27:54] [INFO ] After 1555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 32 ms.
Support contains 11 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 570/570 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 584 transition count 568
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 584 transition count 565
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 581 transition count 565
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 579 transition count 563
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 576 transition count 569
Applied a total of 20 rules in 102 ms. Remains 576 /586 variables (removed 10) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 576/586 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 138099 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138099 steps, saw 87854 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 569 rows 576 cols
[2023-03-20 00:27:58] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-20 00:27:58] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:27:58] [INFO ] [Nat]Absence check using 269 positive place invariants in 48 ms returned sat
[2023-03-20 00:27:59] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:27:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:27:59] [INFO ] After 134ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:27:59] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-20 00:27:59] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 73 ms.
Support contains 11 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 569/569 transitions.
Applied a total of 0 rules in 19 ms. Remains 576 /576 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 576/576 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 569/569 transitions.
Applied a total of 0 rules in 15 ms. Remains 576 /576 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-20 00:28:00] [INFO ] Invariant cache hit.
[2023-03-20 00:28:00] [INFO ] Implicit Places using invariants in 832 ms returned [565]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 836 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 575/576 places, 569/569 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 574 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 574 transition count 568
Applied a total of 2 rules in 35 ms. Remains 574 /575 variables (removed 1) and now considering 568/569 (removed 1) transitions.
// Phase 1: matrix 568 rows 574 cols
[2023-03-20 00:28:00] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:28:01] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-20 00:28:01] [INFO ] Invariant cache hit.
[2023-03-20 00:28:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:28:02] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 574/576 places, 568/569 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2432 ms. Remains : 574/576 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 134487 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134487 steps, saw 85563 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:28:05] [INFO ] Invariant cache hit.
[2023-03-20 00:28:06] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:28:06] [INFO ] [Nat]Absence check using 268 positive place invariants in 40 ms returned sat
[2023-03-20 00:28:06] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:28:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:28:07] [INFO ] After 169ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:28:07] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-20 00:28:07] [INFO ] After 1630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 89 ms.
Support contains 11 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 574 /574 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 574/574 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 574 /574 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-20 00:28:07] [INFO ] Invariant cache hit.
[2023-03-20 00:28:08] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-20 00:28:08] [INFO ] Invariant cache hit.
[2023-03-20 00:28:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:28:09] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2023-03-20 00:28:09] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-20 00:28:09] [INFO ] Invariant cache hit.
[2023-03-20 00:28:09] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1839 ms. Remains : 574/574 places, 568/568 transitions.
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 574 transition count 568
Applied a total of 58 rules in 17 ms. Remains 574 /574 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 568 rows 574 cols
[2023-03-20 00:28:09] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:28:09] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:28:09] [INFO ] [Nat]Absence check using 268 positive place invariants in 38 ms returned sat
[2023-03-20 00:28:10] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:28:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 00:28:10] [INFO ] After 272ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:28:10] [INFO ] After 579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-20 00:28:11] [INFO ] After 1353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 479 stabilizing places and 479 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(F(p0)))'
Support contains 2 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1771 transition count 1621
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1771 transition count 1621
Applied a total of 16 rules in 190 ms. Remains 1771 /1779 variables (removed 8) and now considering 1621/1629 (removed 8) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-20 00:28:11] [INFO ] Computed 271 place invariants in 22 ms
[2023-03-20 00:28:12] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-20 00:28:12] [INFO ] Invariant cache hit.
[2023-03-20 00:28:14] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2834 ms to find 0 implicit places.
[2023-03-20 00:28:14] [INFO ] Invariant cache hit.
[2023-03-20 00:28:15] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1779 places, 1621/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3896 ms. Remains : 1771/1779 places, 1621/1629 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s636 0) (EQ s1325 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1002 ms.
Product exploration explored 100000 steps with 50000 reset in 844 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-030B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-01 finished in 6221 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(X(X(F((p0 U (G(p0)||p1))))))))'
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1773 transition count 1623
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1773 transition count 1623
Applied a total of 12 rules in 260 ms. Remains 1773 /1779 variables (removed 6) and now considering 1623/1629 (removed 6) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-20 00:28:17] [INFO ] Computed 271 place invariants in 13 ms
[2023-03-20 00:28:18] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-20 00:28:18] [INFO ] Invariant cache hit.
[2023-03-20 00:28:20] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2023-03-20 00:28:20] [INFO ] Invariant cache hit.
[2023-03-20 00:28:21] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1773/1779 places, 1623/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3775 ms. Remains : 1773/1779 places, 1623/1629 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1720 0) (EQ s944 1)), p0:(OR (EQ s764 0) (EQ s919 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18444 reset in 453 ms.
Product exploration explored 100000 steps with 18444 reset in 444 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1773 stabilizing places and 479/1623 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:28:23] [INFO ] Invariant cache hit.
[2023-03-20 00:28:23] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:28:23] [INFO ] [Nat]Absence check using 271 positive place invariants in 80 ms returned sat
[2023-03-20 00:28:24] [INFO ] After 1075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:25] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 1 ms to minimize.
[2023-03-20 00:28:25] [INFO ] Deduced a trap composed of 50 places in 407 ms of which 1 ms to minimize.
[2023-03-20 00:28:26] [INFO ] Deduced a trap composed of 20 places in 328 ms of which 2 ms to minimize.
[2023-03-20 00:28:26] [INFO ] Deduced a trap composed of 43 places in 368 ms of which 1 ms to minimize.
[2023-03-20 00:28:27] [INFO ] Deduced a trap composed of 18 places in 361 ms of which 0 ms to minimize.
[2023-03-20 00:28:27] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 1 ms to minimize.
[2023-03-20 00:28:27] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 1 ms to minimize.
[2023-03-20 00:28:28] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 1 ms to minimize.
[2023-03-20 00:28:28] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 2 ms to minimize.
[2023-03-20 00:28:29] [INFO ] Deduced a trap composed of 29 places in 423 ms of which 1 ms to minimize.
[2023-03-20 00:28:29] [INFO ] Deduced a trap composed of 28 places in 286 ms of which 1 ms to minimize.
[2023-03-20 00:28:29] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 1 ms to minimize.
[2023-03-20 00:28:30] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 0 ms to minimize.
[2023-03-20 00:28:30] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 2 ms to minimize.
[2023-03-20 00:28:30] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 9 ms to minimize.
[2023-03-20 00:28:31] [INFO ] Deduced a trap composed of 30 places in 578 ms of which 1 ms to minimize.
[2023-03-20 00:28:31] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2023-03-20 00:28:32] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 1 ms to minimize.
[2023-03-20 00:28:32] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2023-03-20 00:28:32] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 1 ms to minimize.
[2023-03-20 00:28:32] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 1 ms to minimize.
[2023-03-20 00:28:33] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 1 ms to minimize.
[2023-03-20 00:28:33] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 2 ms to minimize.
[2023-03-20 00:28:33] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2023-03-20 00:28:34] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 0 ms to minimize.
[2023-03-20 00:28:34] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 1 ms to minimize.
[2023-03-20 00:28:34] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 1 ms to minimize.
[2023-03-20 00:28:34] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 1 ms to minimize.
[2023-03-20 00:28:35] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 1 ms to minimize.
[2023-03-20 00:28:35] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 0 ms to minimize.
[2023-03-20 00:28:35] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 1 ms to minimize.
[2023-03-20 00:28:36] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 0 ms to minimize.
[2023-03-20 00:28:36] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 1 ms to minimize.
[2023-03-20 00:28:36] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 1 ms to minimize.
[2023-03-20 00:28:36] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 0 ms to minimize.
[2023-03-20 00:28:37] [INFO ] Deduced a trap composed of 39 places in 359 ms of which 0 ms to minimize.
[2023-03-20 00:28:37] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 1 ms to minimize.
[2023-03-20 00:28:37] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 1 ms to minimize.
[2023-03-20 00:28:37] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 1 ms to minimize.
[2023-03-20 00:28:38] [INFO ] Deduced a trap composed of 40 places in 416 ms of which 1 ms to minimize.
[2023-03-20 00:28:38] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 0 ms to minimize.
[2023-03-20 00:28:38] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 0 ms to minimize.
[2023-03-20 00:28:39] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 1 ms to minimize.
[2023-03-20 00:28:39] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 14515 ms
[2023-03-20 00:28:39] [INFO ] After 15639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-20 00:28:39] [INFO ] After 16056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1773 transition count 1266
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1416 transition count 1265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1415 transition count 1265
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 716 place count 1415 transition count 1025
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1196 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2214 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2215 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2395 place count 576 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2396 place count 576 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2425 place count 576 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2426 place count 575 transition count 571
Applied a total of 2426 rules in 186 ms. Remains 575 /1773 variables (removed 1198) and now considering 571/1623 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 575/1773 places, 571/1623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 331946 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331946 steps, saw 216960 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 571 rows 575 cols
[2023-03-20 00:28:42] [INFO ] Computed 271 place invariants in 7 ms
[2023-03-20 00:28:42] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:28:43] [INFO ] [Nat]Absence check using 271 positive place invariants in 46 ms returned sat
[2023-03-20 00:28:43] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 00:28:43] [INFO ] After 23ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:43] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-20 00:28:43] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 30 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 575/575 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 14 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-20 00:28:43] [INFO ] Invariant cache hit.
[2023-03-20 00:28:43] [INFO ] Implicit Places using invariants in 458 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 571/571 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 570
Applied a total of 2 rules in 13 ms. Remains 573 /574 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 573 cols
[2023-03-20 00:28:43] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-20 00:28:44] [INFO ] Implicit Places using invariants in 327 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 572/575 places, 570/571 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 15 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2023-03-20 00:28:44] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-20 00:28:44] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-20 00:28:44] [INFO ] Invariant cache hit.
[2023-03-20 00:28:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:28:45] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 571/575 places, 569/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1922 ms. Remains : 571/575 places, 569/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318063 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 318063 steps, saw 204503 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:28:48] [INFO ] Invariant cache hit.
[2023-03-20 00:28:48] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:28:48] [INFO ] [Nat]Absence check using 269 positive place invariants in 58 ms returned sat
[2023-03-20 00:28:48] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:28:49] [INFO ] After 93ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:49] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-03-20 00:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-20 00:28:49] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-20 00:28:49] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 17 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 13 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-20 00:28:49] [INFO ] Invariant cache hit.
[2023-03-20 00:28:49] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-20 00:28:49] [INFO ] Invariant cache hit.
[2023-03-20 00:28:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:28:50] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-20 00:28:50] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 00:28:50] [INFO ] Invariant cache hit.
[2023-03-20 00:28:50] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1444 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1515 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 31 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-20 00:28:50] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:28:50] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:28:51] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2023-03-20 00:28:51] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-20 00:28:51] [INFO ] After 59ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:51] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-20 00:28:51] [INFO ] After 618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Applied a total of 0 rules in 130 ms. Remains 1773 /1773 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-20 00:28:52] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-20 00:28:53] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-20 00:28:53] [INFO ] Invariant cache hit.
[2023-03-20 00:28:55] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
[2023-03-20 00:28:55] [INFO ] Invariant cache hit.
[2023-03-20 00:28:56] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3604 ms. Remains : 1773/1773 places, 1623/1623 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1773 stabilizing places and 479/1623 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:28:56] [INFO ] Invariant cache hit.
[2023-03-20 00:28:56] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:28:57] [INFO ] [Nat]Absence check using 271 positive place invariants in 91 ms returned sat
[2023-03-20 00:28:58] [INFO ] After 879ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:28:58] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 1 ms to minimize.
[2023-03-20 00:28:58] [INFO ] Deduced a trap composed of 50 places in 371 ms of which 1 ms to minimize.
[2023-03-20 00:28:59] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 1 ms to minimize.
[2023-03-20 00:28:59] [INFO ] Deduced a trap composed of 43 places in 458 ms of which 1 ms to minimize.
[2023-03-20 00:29:00] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 1 ms to minimize.
[2023-03-20 00:29:00] [INFO ] Deduced a trap composed of 30 places in 326 ms of which 1 ms to minimize.
[2023-03-20 00:29:00] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 1 ms to minimize.
[2023-03-20 00:29:01] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 1 ms to minimize.
[2023-03-20 00:29:01] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 1 ms to minimize.
[2023-03-20 00:29:01] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 0 ms to minimize.
[2023-03-20 00:29:02] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 0 ms to minimize.
[2023-03-20 00:29:02] [INFO ] Deduced a trap composed of 30 places in 337 ms of which 1 ms to minimize.
[2023-03-20 00:29:03] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 0 ms to minimize.
[2023-03-20 00:29:03] [INFO ] Deduced a trap composed of 26 places in 345 ms of which 1 ms to minimize.
[2023-03-20 00:29:03] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 2 ms to minimize.
[2023-03-20 00:29:04] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 1 ms to minimize.
[2023-03-20 00:29:04] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2023-03-20 00:29:04] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 0 ms to minimize.
[2023-03-20 00:29:05] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 1 ms to minimize.
[2023-03-20 00:29:05] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 0 ms to minimize.
[2023-03-20 00:29:05] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 0 ms to minimize.
[2023-03-20 00:29:06] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 1 ms to minimize.
[2023-03-20 00:29:06] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 1 ms to minimize.
[2023-03-20 00:29:06] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 1 ms to minimize.
[2023-03-20 00:29:07] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 1 ms to minimize.
[2023-03-20 00:29:07] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2023-03-20 00:29:07] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2023-03-20 00:29:07] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 1 ms to minimize.
[2023-03-20 00:29:08] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 1 ms to minimize.
[2023-03-20 00:29:08] [INFO ] Deduced a trap composed of 41 places in 476 ms of which 1 ms to minimize.
[2023-03-20 00:29:09] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 1 ms to minimize.
[2023-03-20 00:29:09] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 1 ms to minimize.
[2023-03-20 00:29:09] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 1 ms to minimize.
[2023-03-20 00:29:09] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 0 ms to minimize.
[2023-03-20 00:29:10] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 1 ms to minimize.
[2023-03-20 00:29:10] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 1 ms to minimize.
[2023-03-20 00:29:10] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 0 ms to minimize.
[2023-03-20 00:29:11] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 1 ms to minimize.
[2023-03-20 00:29:11] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 0 ms to minimize.
[2023-03-20 00:29:11] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 0 ms to minimize.
[2023-03-20 00:29:11] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 0 ms to minimize.
[2023-03-20 00:29:12] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2023-03-20 00:29:12] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 1 ms to minimize.
[2023-03-20 00:29:12] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 14237 ms
[2023-03-20 00:29:12] [INFO ] After 15177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-20 00:29:12] [INFO ] After 15613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1773 transition count 1266
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1416 transition count 1265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1415 transition count 1265
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 716 place count 1415 transition count 1025
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1196 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2214 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2215 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2395 place count 576 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2396 place count 576 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2425 place count 576 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2426 place count 575 transition count 571
Applied a total of 2426 rules in 210 ms. Remains 575 /1773 variables (removed 1198) and now considering 571/1623 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 575/1773 places, 571/1623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 348478 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348478 steps, saw 227963 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 571 rows 575 cols
[2023-03-20 00:29:15] [INFO ] Computed 271 place invariants in 3 ms
[2023-03-20 00:29:16] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:16] [INFO ] [Nat]Absence check using 271 positive place invariants in 45 ms returned sat
[2023-03-20 00:29:16] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 00:29:16] [INFO ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:16] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 00:29:16] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 21 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 575/575 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 7 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-20 00:29:16] [INFO ] Invariant cache hit.
[2023-03-20 00:29:17] [INFO ] Implicit Places using invariants in 485 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 499 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 571/571 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 570
Applied a total of 2 rules in 9 ms. Remains 573 /574 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 573 cols
[2023-03-20 00:29:17] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-20 00:29:17] [INFO ] Implicit Places using invariants in 373 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 572/575 places, 570/571 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 12 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2023-03-20 00:29:17] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-20 00:29:17] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-20 00:29:17] [INFO ] Invariant cache hit.
[2023-03-20 00:29:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:29:18] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 571/575 places, 569/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2030 ms. Remains : 571/575 places, 569/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335954 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335954 steps, saw 216531 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:29:21] [INFO ] Invariant cache hit.
[2023-03-20 00:29:21] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:21] [INFO ] [Nat]Absence check using 269 positive place invariants in 32 ms returned sat
[2023-03-20 00:29:22] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:29:22] [INFO ] After 30ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:22] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-20 00:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-20 00:29:22] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-20 00:29:22] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-20 00:29:22] [INFO ] Invariant cache hit.
[2023-03-20 00:29:22] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-20 00:29:22] [INFO ] Invariant cache hit.
[2023-03-20 00:29:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:29:23] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
[2023-03-20 00:29:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:29:23] [INFO ] Invariant cache hit.
[2023-03-20 00:29:24] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1676 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1515 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 19 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-20 00:29:24] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:29:24] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:24] [INFO ] [Nat]Absence check using 268 positive place invariants in 30 ms returned sat
[2023-03-20 00:29:24] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-20 00:29:24] [INFO ] After 59ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:24] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-20 00:29:24] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18421 reset in 467 ms.
Product exploration explored 100000 steps with 18420 reset in 531 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1773 transition count 1623
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 358 place count 1773 transition count 1714
Deduced a syphon composed of 478 places in 2 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 478 place count 1773 transition count 1714
Performed 601 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1079 places in 2 ms
Iterating global reduction 1 with 601 rules applied. Total rules applied 1079 place count 1773 transition count 1716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1080 place count 1773 transition count 1715
Renaming transitions due to excessive name length > 1024 char.
Discarding 242 places :
Symmetric choice reduction at 2 with 242 rule applications. Total rules 1322 place count 1531 transition count 1471
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 2 with 242 rules applied. Total rules applied 1564 place count 1531 transition count 1471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 838 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1565 place count 1531 transition count 1471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1567 place count 1529 transition count 1469
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1569 place count 1529 transition count 1469
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -533
Deduced a syphon composed of 937 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1670 place count 1529 transition count 2002
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1771 place count 1428 transition count 1800
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1872 place count 1428 transition count 1800
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 852 places in 2 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1888 place count 1428 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1904 place count 1412 transition count 1860
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1920 place count 1412 transition count 1860
Deduced a syphon composed of 836 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1929 place count 1412 transition count 1851
Deduced a syphon composed of 836 places in 2 ms
Applied a total of 1929 rules in 1223 ms. Remains 1412 /1773 variables (removed 361) and now considering 1851/1623 (removed -228) transitions.
[2023-03-20 00:29:28] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1851 rows 1412 cols
[2023-03-20 00:29:28] [INFO ] Computed 271 place invariants in 14 ms
[2023-03-20 00:29:29] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1412/1773 places, 1851/1623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2242 ms. Remains : 1412/1773 places, 1851/1623 transitions.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Applied a total of 0 rules in 84 ms. Remains 1773 /1773 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-20 00:29:29] [INFO ] Computed 271 place invariants in 19 ms
[2023-03-20 00:29:30] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-20 00:29:30] [INFO ] Invariant cache hit.
[2023-03-20 00:29:31] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2023-03-20 00:29:31] [INFO ] Invariant cache hit.
[2023-03-20 00:29:32] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3175 ms. Remains : 1773/1773 places, 1623/1623 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-03 finished in 75448 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((p0||G(p1)))))'
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1778 transition count 1273
Reduce places removed 355 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 1423 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 712 place count 1422 transition count 1272
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 712 place count 1422 transition count 1035
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1186 place count 1185 transition count 1035
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1191 place count 1180 transition count 1030
Iterating global reduction 3 with 5 rules applied. Total rules applied 1196 place count 1180 transition count 1030
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1196 place count 1180 transition count 1027
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1202 place count 1177 transition count 1027
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 3 with 1022 rules applied. Total rules applied 2224 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 2225 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2227 place count 665 transition count 514
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2401 place count 578 transition count 568
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2403 place count 576 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2405 place count 574 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 2405 place count 574 transition count 565
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 2407 place count 573 transition count 565
Applied a total of 2407 rules in 322 ms. Remains 573 /1779 variables (removed 1206) and now considering 565/1629 (removed 1064) transitions.
// Phase 1: matrix 565 rows 573 cols
[2023-03-20 00:29:33] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:29:33] [INFO ] Implicit Places using invariants in 306 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 307 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1779 places, 565/1629 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 571 transition count 564
Applied a total of 2 rules in 18 ms. Remains 571 /572 variables (removed 1) and now considering 564/565 (removed 1) transitions.
// Phase 1: matrix 564 rows 571 cols
[2023-03-20 00:29:33] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:29:34] [INFO ] Implicit Places using invariants in 339 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 596 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1779 places, 564/1629 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1582 ms. Remains : 571/1779 places, 564/1629 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s156 0) (EQ s196 1)), p0:(AND (EQ s231 0) (EQ s34 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-04 finished in 1710 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(((!p1 U (p2||G(!p1)))&&p0)))))'
Support contains 5 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1773 transition count 1623
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1773 transition count 1623
Applied a total of 12 rules in 197 ms. Remains 1773 /1779 variables (removed 6) and now considering 1623/1629 (removed 6) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-20 00:29:34] [INFO ] Computed 271 place invariants in 9 ms
[2023-03-20 00:29:35] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-20 00:29:35] [INFO ] Invariant cache hit.
[2023-03-20 00:29:37] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
[2023-03-20 00:29:37] [INFO ] Invariant cache hit.
[2023-03-20 00:29:38] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1773/1779 places, 1623/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3648 ms. Remains : 1773/1779 places, 1623/1629 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s1220 0) (EQ s1273 1)), p2:(AND (NOT (AND (OR (EQ s918 0) (EQ s668 1)) (OR (EQ s1273 0) (EQ s1220 1)))) (NOT (AND (NOT (OR (EQ s1273 0) (EQ s1...], 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 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-06 finished in 3853 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)))'
Support contains 5 out of 1779 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1778 transition count 1273
Reduce places removed 355 places and 0 transitions.
Iterating post reduction 1 with 355 rules applied. Total rules applied 710 place count 1423 transition count 1273
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 710 place count 1423 transition count 1034
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1188 place count 1184 transition count 1034
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1193 place count 1179 transition count 1029
Iterating global reduction 2 with 5 rules applied. Total rules applied 1198 place count 1179 transition count 1029
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1198 place count 1179 transition count 1026
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1204 place count 1176 transition count 1026
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 2222 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 2223 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2225 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2403 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 2405 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 2407 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 2407 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 2409 place count 572 transition count 570
Applied a total of 2409 rules in 311 ms. Remains 572 /1779 variables (removed 1207) and now considering 570/1629 (removed 1059) transitions.
// Phase 1: matrix 570 rows 572 cols
[2023-03-20 00:29:38] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-20 00:29:39] [INFO ] Implicit Places using invariants in 290 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1779 places, 570/1629 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 18 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:29:39] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:29:39] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-20 00:29:39] [INFO ] Invariant cache hit.
[2023-03-20 00:29:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:29:40] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1779 places, 569/1629 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1848 ms. Remains : 570/1779 places, 569/1629 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s414 0) (EQ s384 1) (EQ s286 1) (EQ s35 0) (EQ s288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 591 ms.
Product exploration explored 100000 steps with 0 reset in 800 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 417305 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417305 steps, saw 252595 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:29:45] [INFO ] Invariant cache hit.
[2023-03-20 00:29:45] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:45] [INFO ] [Nat]Absence check using 268 positive place invariants in 34 ms returned sat
[2023-03-20 00:29:45] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:29:45] [INFO ] After 50ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:45] [INFO ] After 112ms 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:45] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 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 570 transition count 568
Applied a total of 1 rules in 19 ms. Remains 570 /570 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 570/570 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 378932 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 378932 steps, saw 244271 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-20 00:29:49] [INFO ] Computed 268 place invariants in 4 ms
[2023-03-20 00:29:49] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:49] [INFO ] [Nat]Absence check using 268 positive place invariants in 29 ms returned sat
[2023-03-20 00:29:49] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:29:49] [INFO ] After 47ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:49] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 00:29:49] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 21 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 570/570 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-20 00:29:49] [INFO ] Invariant cache hit.
[2023-03-20 00:29:50] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-20 00:29:50] [INFO ] Invariant cache hit.
[2023-03-20 00:29:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:29:50] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-03-20 00:29:50] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 00:29:50] [INFO ] Invariant cache hit.
[2023-03-20 00:29:51] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1512 ms. Remains : 570/570 places, 568/568 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 570 transition count 568
Applied a total of 60 rules in 17 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-20 00:29:51] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:29:51] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:51] [INFO ] [Nat]Absence check using 268 positive place invariants in 34 ms returned sat
[2023-03-20 00:29:51] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:51] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 00:29:51] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 569/569 transitions.
Applied a total of 0 rules in 12 ms. Remains 570 /570 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 570 cols
[2023-03-20 00:29:52] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:29:52] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-20 00:29:52] [INFO ] Invariant cache hit.
[2023-03-20 00:29:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:29:53] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2023-03-20 00:29:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:29:53] [INFO ] Invariant cache hit.
[2023-03-20 00:29:53] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1365 ms. Remains : 570/570 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
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403189 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403189 steps, saw 243761 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:29:56] [INFO ] Invariant cache hit.
[2023-03-20 00:29:56] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:29:57] [INFO ] [Nat]Absence check using 268 positive place invariants in 69 ms returned sat
[2023-03-20 00:29:57] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:29:57] [INFO ] After 35ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:29:57] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-20 00:29:57] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 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 570 transition count 568
Applied a total of 1 rules in 18 ms. Remains 570 /570 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 570/570 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 404831 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404831 steps, saw 260583 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-20 00:30:00] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:30:00] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:00] [INFO ] [Nat]Absence check using 268 positive place invariants in 36 ms returned sat
[2023-03-20 00:30:01] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:30:01] [INFO ] After 26ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:01] [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 39 ms.
[2023-03-20 00:30:01] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 570/570 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-20 00:30:01] [INFO ] Invariant cache hit.
[2023-03-20 00:30:01] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-20 00:30:01] [INFO ] Invariant cache hit.
[2023-03-20 00:30:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:30:02] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2023-03-20 00:30:02] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 00:30:02] [INFO ] Invariant cache hit.
[2023-03-20 00:30:02] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1329 ms. Remains : 570/570 places, 568/568 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 570 transition count 568
Applied a total of 60 rules in 18 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-20 00:30:02] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:30:02] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:02] [INFO ] [Nat]Absence check using 268 positive place invariants in 35 ms returned sat
[2023-03-20 00:30:03] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:03] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-20 00:30:03] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 489 ms.
Product exploration explored 100000 steps with 0 reset in 648 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 570 /570 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 570 cols
[2023-03-20 00:30:04] [INFO ] Computed 268 place invariants in 15 ms
[2023-03-20 00:30:05] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-20 00:30:05] [INFO ] Invariant cache hit.
[2023-03-20 00:30:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:30:05] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2023-03-20 00:30:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:30:05] [INFO ] Invariant cache hit.
[2023-03-20 00:30:05] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1128 ms. Remains : 570/570 places, 569/569 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-09 finished in 27283 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(p0)||X(G((p1&&X(p2))))))'
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1772 transition count 1622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1772 transition count 1622
Applied a total of 14 rules in 152 ms. Remains 1772 /1779 variables (removed 7) and now considering 1622/1629 (removed 7) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-20 00:30:06] [INFO ] Computed 271 place invariants in 9 ms
[2023-03-20 00:30:06] [INFO ] Implicit Places using invariants in 583 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 2341 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
[2023-03-20 00:30:08] [INFO ] Invariant cache hit.
[2023-03-20 00:30:10] [INFO ] Dead Transitions using invariants and state equation in 1082 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1779 places, 1622/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4176 ms. Remains : 1772/1779 places, 1622/1629 transitions.
Stuttering acceptance computed with spot in 430 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-12 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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s1507 0) (EQ s992 1)), p1:(EQ s883 1), p2:(EQ s478 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-12 finished in 4661 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(p0)))'
Support contains 1 out of 1779 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1778 transition count 1270
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1420 transition count 1270
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 716 place count 1420 transition count 1032
Deduced a syphon composed of 238 places in 2 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1192 place count 1182 transition count 1032
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1198 place count 1176 transition count 1026
Iterating global reduction 2 with 6 rules applied. Total rules applied 1204 place count 1176 transition count 1026
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1204 place count 1176 transition count 1022
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 1212 place count 1172 transition count 1022
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2230 place count 663 transition count 513
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 663 transition count 512
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 662 transition count 511
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 2411 place count 573 transition count 570
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2413 place count 571 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2415 place count 569 transition count 568
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2415 place count 569 transition count 567
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 2417 place count 568 transition count 567
Applied a total of 2417 rules in 285 ms. Remains 568 /1779 variables (removed 1211) and now considering 567/1629 (removed 1062) transitions.
// Phase 1: matrix 567 rows 568 cols
[2023-03-20 00:30:10] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-20 00:30:11] [INFO ] Implicit Places using invariants in 392 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 406 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 567/1779 places, 567/1629 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 566 transition count 566
Applied a total of 2 rules in 16 ms. Remains 566 /567 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 566 cols
[2023-03-20 00:30:11] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:30:11] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-20 00:30:11] [INFO ] Invariant cache hit.
[2023-03-20 00:30:12] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 566/1779 places, 566/1629 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1616 ms. Remains : 566/1779 places, 566/1629 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41453 steps with 0 reset in 241 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-13 finished in 1974 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((p0&&F(p1))))'
Support contains 3 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1772 transition count 1622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1772 transition count 1622
Applied a total of 14 rules in 146 ms. Remains 1772 /1779 variables (removed 7) and now considering 1622/1629 (removed 7) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-20 00:30:12] [INFO ] Computed 271 place invariants in 9 ms
[2023-03-20 00:30:13] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-20 00:30:13] [INFO ] Invariant cache hit.
[2023-03-20 00:30:15] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 2893 ms to find 0 implicit places.
[2023-03-20 00:30:15] [INFO ] Invariant cache hit.
[2023-03-20 00:30:16] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1779 places, 1622/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4049 ms. Remains : 1772/1779 places, 1622/1629 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s92 0) (EQ s512 1)), p0:(EQ s1534 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, null][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-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-15 finished in 4235 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(X(X(F((p0 U (G(p0)||p1))))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-030B-LTLCardinality-03
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1778 transition count 1273
Reduce places removed 355 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 1423 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 712 place count 1422 transition count 1272
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 712 place count 1422 transition count 1033
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1190 place count 1183 transition count 1033
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1194 place count 1179 transition count 1029
Iterating global reduction 3 with 4 rules applied. Total rules applied 1198 place count 1179 transition count 1029
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1198 place count 1179 transition count 1025
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1206 place count 1175 transition count 1025
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 3 with 1016 rules applied. Total rules applied 2222 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2223 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2225 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2403 place count 577 transition count 574
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2405 place count 575 transition count 572
Applied a total of 2405 rules in 395 ms. Remains 575 /1779 variables (removed 1204) and now considering 572/1629 (removed 1057) transitions.
// Phase 1: matrix 572 rows 575 cols
[2023-03-20 00:30:17] [INFO ] Computed 271 place invariants in 1 ms
[2023-03-20 00:30:17] [INFO ] Implicit Places using invariants in 367 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 574/1779 places, 572/1629 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 571
Applied a total of 2 rules in 22 ms. Remains 573 /574 variables (removed 1) and now considering 571/572 (removed 1) transitions.
// Phase 1: matrix 571 rows 573 cols
[2023-03-20 00:30:18] [INFO ] Computed 270 place invariants in 14 ms
[2023-03-20 00:30:18] [INFO ] Implicit Places using invariants in 603 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 605 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 572/1779 places, 571/1629 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 571 transition count 570
Applied a total of 2 rules in 14 ms. Remains 571 /572 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 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 346 ms returned []
[2023-03-20 00:30:18] [INFO ] Invariant cache hit.
[2023-03-20 00:30:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:30:19] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 571/1779 places, 570/1629 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2554 ms. Remains : 571/1779 places, 570/1629 transitions.
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s557 0) (EQ s304 1)), p0:(OR (EQ s243 0) (EQ s292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 485 ms.
Product exploration explored 100000 steps with 20000 reset in 689 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/571 stabilizing places and 4/570 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:30:21] [INFO ] Invariant cache hit.
[2023-03-20 00:30:21] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:21] [INFO ] [Nat]Absence check using 269 positive place invariants in 34 ms returned sat
[2023-03-20 00:30:22] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:30:22] [INFO ] After 20ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:22] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 00:30:22] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 570/570 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 571 transition count 569
Applied a total of 1 rules in 10 ms. Remains 571 /571 variables (removed 0) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 571/571 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 405794 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 405794 steps, saw 292950 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 571 cols
[2023-03-20 00:30:25] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:30:25] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:25] [INFO ] [Nat]Absence check using 269 positive place invariants in 44 ms returned sat
[2023-03-20 00:30:25] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:30:25] [INFO ] After 49ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:25] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-03-20 00:30:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-20 00:30:25] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 00:30:26] [INFO ] After 634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 10 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 22 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-20 00:30:26] [INFO ] Invariant cache hit.
[2023-03-20 00:30:26] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-20 00:30:26] [INFO ] Invariant cache hit.
[2023-03-20 00:30:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:30:27] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2023-03-20 00:30:27] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 00:30:27] [INFO ] Invariant cache hit.
[2023-03-20 00:30:27] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1425 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1403 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 18 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-20 00:30:27] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-20 00:30:27] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:27] [INFO ] [Nat]Absence check using 268 positive place invariants in 60 ms returned sat
[2023-03-20 00:30:28] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:30:28] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:28] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 00:30:28] [INFO ] After 452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 570/570 transitions.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-20 00:30:29] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-20 00:30:29] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-20 00:30:29] [INFO ] Invariant cache hit.
[2023-03-20 00:30:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:30:30] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
[2023-03-20 00:30:30] [INFO ] Invariant cache hit.
[2023-03-20 00:30:30] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1708 ms. Remains : 571/571 places, 570/570 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/571 stabilizing places and 4/570 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:30:31] [INFO ] Invariant cache hit.
[2023-03-20 00:30:31] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:31] [INFO ] [Nat]Absence check using 269 positive place invariants in 56 ms returned sat
[2023-03-20 00:30:31] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:30:31] [INFO ] After 16ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:31] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-20 00:30:31] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 570/570 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 571 transition count 569
Applied a total of 1 rules in 11 ms. Remains 571 /571 variables (removed 0) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 571/571 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 407170 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407170 steps, saw 293919 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 571 cols
[2023-03-20 00:30:34] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:30:35] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:35] [INFO ] [Nat]Absence check using 269 positive place invariants in 309 ms returned sat
[2023-03-20 00:30:35] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:30:35] [INFO ] After 68ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:36] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 1 ms to minimize.
[2023-03-20 00:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2023-03-20 00:30:36] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-20 00:30:36] [INFO ] After 1333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-20 00:30:36] [INFO ] Invariant cache hit.
[2023-03-20 00:30:37] [INFO ] Implicit Places using invariants in 791 ms returned []
[2023-03-20 00:30:37] [INFO ] Invariant cache hit.
[2023-03-20 00:30:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:30:38] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2023-03-20 00:30:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 00:30:38] [INFO ] Invariant cache hit.
[2023-03-20 00:30:38] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2386 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1403 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 24 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-20 00:30:38] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:30:38] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:30:39] [INFO ] [Nat]Absence check using 268 positive place invariants in 43 ms returned sat
[2023-03-20 00:30:39] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:30:39] [INFO ] After 39ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:30:39] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-20 00:30:39] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 516 ms.
Product exploration explored 100000 steps with 20000 reset in 593 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 570/570 transitions.
Applied a total of 0 rules in 8 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2023-03-20 00:30:42] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 570 rows 571 cols
[2023-03-20 00:30:42] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:30:42] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 571/571 places, 570/570 transitions.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 570/570 transitions.
Applied a total of 0 rules in 5 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2023-03-20 00:30:42] [INFO ] Invariant cache hit.
[2023-03-20 00:30:43] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-20 00:30:43] [INFO ] Invariant cache hit.
[2023-03-20 00:30:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:30:43] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2023-03-20 00:30:43] [INFO ] Invariant cache hit.
[2023-03-20 00:30:44] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1367 ms. Remains : 571/571 places, 570/570 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-03 finished in 27461 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)))'
[2023-03-20 00:30:44] [INFO ] Flatten gal took : 78 ms
[2023-03-20 00:30:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 00:30:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1779 places, 1629 transitions and 4218 arcs took 10 ms.
Total runtime 204710 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-030B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality

FORMULA ShieldIIPt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679272280247

--------------------
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 LTLCardinality -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/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
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 # 4 (type EXCL) for 3 ShieldIIPt-PT-030B-LTLCardinality-09
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ShieldIIPt-PT-030B-LTLCardinality-09
lola: result : false
lola: markings : 4624
lola: fired transitions : 5216
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-030B-LTLCardinality-03
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 6/32 ShieldIIPt-PT-030B-LTLCardinality-03 190764 m, 38152 m/sec, 499738 t fired, .

Time elapsed: 6 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 10/32 ShieldIIPt-PT-030B-LTLCardinality-03 378016 m, 37450 m/sec, 1050803 t fired, .

Time elapsed: 11 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 15/32 ShieldIIPt-PT-030B-LTLCardinality-03 563610 m, 37118 m/sec, 1601786 t fired, .

Time elapsed: 16 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 20/32 ShieldIIPt-PT-030B-LTLCardinality-03 757185 m, 38715 m/sec, 2153201 t fired, .

Time elapsed: 21 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3599 25/32 ShieldIIPt-PT-030B-LTLCardinality-03 934209 m, 35404 m/sec, 2705777 t fired, .

Time elapsed: 26 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3599 30/32 ShieldIIPt-PT-030B-LTLCardinality-03 1102764 m, 33711 m/sec, 3258815 t fired, .

Time elapsed: 31 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for ShieldIIPt-PT-030B-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-030B-LTLCardinality-03: 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: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-LTLCardinality-03: LTL unknown AGGR
ShieldIIPt-PT-030B-LTLCardinality-09: LTL false 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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715100299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;