Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716953537338

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 03:32:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:32:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:32:19] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-29 03:32:19] [INFO ] Transformed 2103 places.
[2024-05-29 03:32:19] [INFO ] Transformed 1953 transitions.
[2024-05-29 03:32:19] [INFO ] Found NUPN structural information;
[2024-05-29 03:32:19] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1783 transition count 1633
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1783 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 641 place count 1782 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 642 place count 1782 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 1781 transition count 1631
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 1781 transition count 1631
Applied a total of 644 rules in 717 ms. Remains 1781 /2103 variables (removed 322) and now considering 1631/1953 (removed 322) transitions.
// Phase 1: matrix 1631 rows 1781 cols
[2024-05-29 03:32:20] [INFO ] Computed 271 invariants in 37 ms
[2024-05-29 03:32:21] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-29 03:32:21] [INFO ] Invariant cache hit.
[2024-05-29 03:32:23] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
[2024-05-29 03:32:23] [INFO ] Invariant cache hit.
[2024-05-29 03:32:24] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1781/2103 places, 1631/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4185 ms. Remains : 1781/2103 places, 1631/1953 transitions.
Support contains 47 out of 1781 places after structural reductions.
[2024-05-29 03:32:24] [INFO ] Flatten gal took : 131 ms
[2024-05-29 03:32:24] [INFO ] Flatten gal took : 74 ms
[2024-05-29 03:32:24] [INFO ] Input system was already deterministic with 1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 31) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-29 03:32:25] [INFO ] Invariant cache hit.
[2024-05-29 03:32:26] [INFO ] [Real]Absence check using 271 positive place invariants in 87 ms returned sat
[2024-05-29 03:32:26] [INFO ] After 967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 03:32:27] [INFO ] [Nat]Absence check using 271 positive place invariants in 98 ms returned sat
[2024-05-29 03:32:29] [INFO ] After 1639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 03:32:29] [INFO ] Deduced a trap composed of 18 places in 429 ms of which 9 ms to minimize.
[2024-05-29 03:32:30] [INFO ] Deduced a trap composed of 20 places in 408 ms of which 1 ms to minimize.
[2024-05-29 03:32:30] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 1 ms to minimize.
[2024-05-29 03:32:30] [INFO ] Deduced a trap composed of 38 places in 343 ms of which 2 ms to minimize.
[2024-05-29 03:32:31] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 1 ms to minimize.
[2024-05-29 03:32:31] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 1 ms to minimize.
[2024-05-29 03:32:32] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 1 ms to minimize.
[2024-05-29 03:32:32] [INFO ] Deduced a trap composed of 28 places in 320 ms of which 1 ms to minimize.
[2024-05-29 03:32:32] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 1 ms to minimize.
[2024-05-29 03:32:33] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 2 ms to minimize.
[2024-05-29 03:32:33] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2024-05-29 03:32:34] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 0 ms to minimize.
[2024-05-29 03:32:34] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2024-05-29 03:32:34] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 0 ms to minimize.
[2024-05-29 03:32:35] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 0 ms to minimize.
[2024-05-29 03:32:35] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 1 ms to minimize.
[2024-05-29 03:32:35] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2024-05-29 03:32:36] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 2 ms to minimize.
[2024-05-29 03:32:36] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 0 ms to minimize.
[2024-05-29 03:32:36] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 1 ms to minimize.
[2024-05-29 03:32:37] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 0 ms to minimize.
[2024-05-29 03:32:37] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2024-05-29 03:32:37] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 1 ms to minimize.
[2024-05-29 03:32:38] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 1 ms to minimize.
[2024-05-29 03:32:38] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 1 ms to minimize.
[2024-05-29 03:32:38] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2024-05-29 03:32:38] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 1 ms to minimize.
[2024-05-29 03:32:39] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2024-05-29 03:32:39] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2024-05-29 03:32:39] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 1 ms to minimize.
[2024-05-29 03:32:40] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 1 ms to minimize.
[2024-05-29 03:32:40] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 0 ms to minimize.
[2024-05-29 03:32:40] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 1 ms to minimize.
[2024-05-29 03:32:40] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-05-29 03:32:41] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 0 ms to minimize.
[2024-05-29 03:32:41] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 1 ms to minimize.
[2024-05-29 03:32:41] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 1 ms to minimize.
[2024-05-29 03:32:41] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2024-05-29 03:32:42] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 0 ms to minimize.
[2024-05-29 03:32:42] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
[2024-05-29 03:32:42] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 1 ms to minimize.
[2024-05-29 03:32:42] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2024-05-29 03:32:43] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2024-05-29 03:32:43] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 0 ms to minimize.
[2024-05-29 03:32:43] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2024-05-29 03:32:43] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 0 ms to minimize.
[2024-05-29 03:32:43] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 1 ms to minimize.
[2024-05-29 03:32:44] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 0 ms to minimize.
[2024-05-29 03:32:44] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 0 ms to minimize.
[2024-05-29 03:32:44] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2024-05-29 03:32:44] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-05-29 03:32:44] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 0 ms to minimize.
[2024-05-29 03:32:45] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 0 ms to minimize.
[2024-05-29 03:32:45] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 1 ms to minimize.
[2024-05-29 03:32:45] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 1 ms to minimize.
[2024-05-29 03:32:45] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 4 ms to minimize.
[2024-05-29 03:32:45] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 16583 ms
[2024-05-29 03:32:46] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2024-05-29 03:32:46] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2024-05-29 03:32:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2024-05-29 03:32:46] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
[2024-05-29 03:32:46] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 1 ms to minimize.
[2024-05-29 03:32:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2024-05-29 03:32:47] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 0 ms to minimize.
[2024-05-29 03:32:47] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2024-05-29 03:32:47] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2024-05-29 03:32:48] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 1 ms to minimize.
[2024-05-29 03:32:48] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 0 ms to minimize.
[2024-05-29 03:32:48] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 0 ms to minimize.
[2024-05-29 03:32:48] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2024-05-29 03:32:48] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 0 ms to minimize.
[2024-05-29 03:32:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1864 ms
[2024-05-29 03:32:49] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 0 ms to minimize.
[2024-05-29 03:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2024-05-29 03:32:49] [INFO ] After 22383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 941 ms.
[2024-05-29 03:32:50] [INFO ] After 24500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 857 ms.
Support contains 22 out of 1781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Drop transitions removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 353 place count 1781 transition count 1278
Reduce places removed 353 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 354 rules applied. Total rules applied 707 place count 1428 transition count 1277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 708 place count 1427 transition count 1277
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 708 place count 1427 transition count 1045
Deduced a syphon composed of 232 places in 2 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 3 with 464 rules applied. Total rules applied 1172 place count 1195 transition count 1045
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1176 place count 1191 transition count 1041
Iterating global reduction 3 with 4 rules applied. Total rules applied 1180 place count 1191 transition count 1041
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1180 place count 1191 transition count 1037
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 1188 place count 1187 transition count 1037
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 503
Deduced a syphon composed of 503 places in 0 ms
Reduce places removed 503 places and 0 transitions.
Iterating global reduction 3 with 1006 rules applied. Total rules applied 2194 place count 684 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2195 place count 684 transition count 533
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2197 place count 683 transition count 532
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2371 place count 596 transition count 589
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2372 place count 596 transition count 588
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2373 place count 596 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2374 place count 595 transition count 587
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 2402 place count 595 transition count 587
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2403 place count 594 transition count 586
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2405 place count 592 transition count 586
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2405 place count 592 transition count 585
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 2407 place count 591 transition count 585
Applied a total of 2407 rules in 429 ms. Remains 591 /1781 variables (removed 1190) and now considering 585/1631 (removed 1046) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 591/1781 places, 585/1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 585 rows 591 cols
[2024-05-29 03:32:53] [INFO ] Computed 269 invariants in 3 ms
[2024-05-29 03:32:53] [INFO ] [Real]Absence check using 269 positive place invariants in 40 ms returned sat
[2024-05-29 03:32:53] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 03:32:53] [INFO ] [Nat]Absence check using 269 positive place invariants in 46 ms returned sat
[2024-05-29 03:32:54] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 03:32:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 03:32:54] [INFO ] After 264ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-29 03:32:54] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-29 03:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-05-29 03:32:54] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 268 ms.
[2024-05-29 03:32:55] [INFO ] After 1834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 19 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 585/585 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 588 transition count 582
Applied a total of 6 rules in 34 ms. Remains 588 /591 variables (removed 3) and now considering 582/585 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 588/591 places, 582/585 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) 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 10) 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 10) seen :0
Interrupted probabilistic random walk after 126260 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126260 steps, saw 83310 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 582 rows 588 cols
[2024-05-29 03:32:59] [INFO ] Computed 269 invariants in 3 ms
[2024-05-29 03:32:59] [INFO ] [Real]Absence check using 269 positive place invariants in 44 ms returned sat
[2024-05-29 03:32:59] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 03:32:59] [INFO ] [Nat]Absence check using 269 positive place invariants in 40 ms returned sat
[2024-05-29 03:33:00] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 03:33:00] [INFO ] After 245ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:00] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-05-29 03:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-29 03:33:00] [INFO ] After 704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 237 ms.
[2024-05-29 03:33:00] [INFO ] After 1630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 18 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 582/582 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 587 transition count 581
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 586 transition count 581
Applied a total of 4 rules in 34 ms. Remains 586 /588 variables (removed 2) and now considering 581/582 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 586/588 places, 581/582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 133542 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133542 steps, saw 88102 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 581 rows 586 cols
[2024-05-29 03:33:05] [INFO ] Computed 269 invariants in 5 ms
[2024-05-29 03:33:05] [INFO ] [Real]Absence check using 269 positive place invariants in 41 ms returned sat
[2024-05-29 03:33:05] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 03:33:05] [INFO ] [Nat]Absence check using 269 positive place invariants in 49 ms returned sat
[2024-05-29 03:33:06] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 03:33:06] [INFO ] After 240ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:06] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2024-05-29 03:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-05-29 03:33:06] [INFO ] After 688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-29 03:33:06] [INFO ] After 1669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 18 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 581/581 transitions.
Applied a total of 0 rules in 24 ms. Remains 586 /586 variables (removed 0) and now considering 581/581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 586/586 places, 581/581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 581/581 transitions.
Applied a total of 0 rules in 18 ms. Remains 586 /586 variables (removed 0) and now considering 581/581 (removed 0) transitions.
[2024-05-29 03:33:07] [INFO ] Invariant cache hit.
[2024-05-29 03:33:07] [INFO ] Implicit Places using invariants in 314 ms returned [575]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 585/586 places, 581/581 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 584 transition count 580
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 584 transition count 580
Applied a total of 2 rules in 17 ms. Remains 584 /585 variables (removed 1) and now considering 580/581 (removed 1) transitions.
// Phase 1: matrix 580 rows 584 cols
[2024-05-29 03:33:07] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:33:07] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-29 03:33:07] [INFO ] Invariant cache hit.
[2024-05-29 03:33:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:33:08] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 584/586 places, 580/581 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1340 ms. Remains : 584/586 places, 580/581 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 145167 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145167 steps, saw 96595 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 10 properties.
[2024-05-29 03:33:12] [INFO ] Invariant cache hit.
[2024-05-29 03:33:12] [INFO ] [Real]Absence check using 268 positive place invariants in 43 ms returned sat
[2024-05-29 03:33:12] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 03:33:12] [INFO ] [Nat]Absence check using 268 positive place invariants in 42 ms returned sat
[2024-05-29 03:33:13] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:33:13] [INFO ] After 238ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:13] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 241 ms.
[2024-05-29 03:33:13] [INFO ] After 1577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 197 ms.
Support contains 18 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 580/580 transitions.
Applied a total of 0 rules in 13 ms. Remains 584 /584 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 584/584 places, 580/580 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 580/580 transitions.
Applied a total of 0 rules in 10 ms. Remains 584 /584 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2024-05-29 03:33:14] [INFO ] Invariant cache hit.
[2024-05-29 03:33:14] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-29 03:33:14] [INFO ] Invariant cache hit.
[2024-05-29 03:33:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:33:15] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2024-05-29 03:33:15] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-29 03:33:15] [INFO ] Invariant cache hit.
[2024-05-29 03:33:15] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1355 ms. Remains : 584/584 places, 580/580 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 584 transition count 580
Applied a total of 61 rules in 22 ms. Remains 584 /584 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 580 rows 584 cols
[2024-05-29 03:33:15] [INFO ] Computed 268 invariants in 4 ms
[2024-05-29 03:33:15] [INFO ] [Real]Absence check using 268 positive place invariants in 38 ms returned sat
[2024-05-29 03:33:15] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 03:33:15] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:33:16] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 03:33:16] [INFO ] After 302ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 03:33:17] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-05-29 03:33:17] [INFO ] After 1619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 480 stabilizing places and 480 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 137 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-29 03:33:17] [INFO ] Computed 271 invariants in 9 ms
[2024-05-29 03:33:18] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-29 03:33:18] [INFO ] Invariant cache hit.
[2024-05-29 03:33:19] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
[2024-05-29 03:33:20] [INFO ] Invariant cache hit.
[2024-05-29 03:33:20] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3226 ms. Remains : 1771/1781 places, 1621/1631 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s1389 1) (EQ s588 1)), p0:(EQ s983 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 693 ms.
Stack based approach found an accepted trace after 717 steps with 0 reset with depth 718 and stack size 718 in 6 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-00 finished in 4383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p1&&F(p2))))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1780 transition count 1270
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1420 transition count 1270
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 720 place count 1420 transition count 1035
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1190 place count 1185 transition count 1035
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1195 place count 1180 transition count 1030
Iterating global reduction 2 with 5 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1025
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1210 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2413 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2415 place count 571 transition count 570
Applied a total of 2415 rules in 283 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:33:22] [INFO ] Computed 269 invariants in 3 ms
[2024-05-29 03:33:22] [INFO ] Implicit Places using invariants in 347 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 19 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2024-05-29 03:33:22] [INFO ] Computed 268 invariants in 4 ms
[2024-05-29 03:33:23] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-29 03:33:23] [INFO ] Invariant cache hit.
[2024-05-29 03:33:23] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1618 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s55 1), p2:(EQ s149 1), p1:(EQ s137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-01 finished in 1764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 5 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 1780 transition count 1274
Reduce places removed 356 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 357 rules applied. Total rules applied 713 place count 1424 transition count 1273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 714 place count 1423 transition count 1273
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 714 place count 1423 transition count 1036
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 1188 place count 1186 transition count 1036
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1194 place count 1180 transition count 1030
Iterating global reduction 3 with 6 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1024
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1212 place count 1174 transition count 1024
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 3 with 1012 rules applied. Total rules applied 2224 place count 668 transition count 518
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 668 transition count 517
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 667 transition count 516
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 2405 place count 578 transition count 575
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2407 place count 576 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2409 place count 574 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2409 place count 574 transition count 572
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 2411 place count 573 transition count 572
Applied a total of 2411 rules in 281 ms. Remains 573 /1781 variables (removed 1208) and now considering 572/1631 (removed 1059) transitions.
// Phase 1: matrix 572 rows 573 cols
[2024-05-29 03:33:24] [INFO ] Computed 269 invariants in 5 ms
[2024-05-29 03:33:24] [INFO ] Implicit Places using invariants in 302 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 303 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1781 places, 572/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 571
Applied a total of 2 rules in 17 ms. Remains 571 /572 variables (removed 1) and now considering 571/572 (removed 1) transitions.
// Phase 1: matrix 571 rows 571 cols
[2024-05-29 03:33:24] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:33:24] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-29 03:33:24] [INFO ] Invariant cache hit.
[2024-05-29 03:33:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 03:33:25] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1781 places, 571/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1713 ms. Remains : 571/1781 places, 571/1631 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s39 1) (EQ s328 1) (EQ s349 0)), p0:(OR (EQ s449 0) (EQ s451 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1447 steps with 0 reset in 20 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-02 finished in 1888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 138 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2024-05-29 03:33:25] [INFO ] Computed 271 invariants in 12 ms
[2024-05-29 03:33:26] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-29 03:33:26] [INFO ] Invariant cache hit.
[2024-05-29 03:33:27] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2024-05-29 03:33:27] [INFO ] Invariant cache hit.
[2024-05-29 03:33:28] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3134 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1050 0) (EQ s212 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 923 ms.
Product exploration explored 100000 steps with 33333 reset in 895 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 30 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-030B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030B-LTLFireability-03 finished in 5165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 4 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 151 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-29 03:33:31] [INFO ] Computed 271 invariants in 7 ms
[2024-05-29 03:33:31] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-29 03:33:31] [INFO ] Invariant cache hit.
[2024-05-29 03:33:33] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
[2024-05-29 03:33:33] [INFO ] Invariant cache hit.
[2024-05-29 03:33:34] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3229 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s164 0) (EQ s166 0) (EQ s559 0)), p1:(AND (EQ s559 0) (EQ s1194 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 552 ms.
Product exploration explored 100000 steps with 0 reset in 762 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1771 stabilizing places and 478/1621 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 133 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :2
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.
[2024-05-29 03:33:35] [INFO ] Invariant cache hit.
[2024-05-29 03:33:36] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:36] [INFO ] [Nat]Absence check using 271 positive place invariants in 85 ms returned sat
[2024-05-29 03:33:37] [INFO ] After 737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:37] [INFO ] Deduced a trap composed of 24 places in 367 ms of which 2 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 1 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 23 places in 370 ms of which 1 ms to minimize.
[2024-05-29 03:33:38] [INFO ] Deduced a trap composed of 18 places in 360 ms of which 1 ms to minimize.
[2024-05-29 03:33:39] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 1 ms to minimize.
[2024-05-29 03:33:39] [INFO ] Deduced a trap composed of 18 places in 396 ms of which 2 ms to minimize.
[2024-05-29 03:33:40] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 1 ms to minimize.
[2024-05-29 03:33:40] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 1 ms to minimize.
[2024-05-29 03:33:41] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 0 ms to minimize.
[2024-05-29 03:33:41] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 1 ms to minimize.
[2024-05-29 03:33:41] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2024-05-29 03:33:42] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 1 ms to minimize.
[2024-05-29 03:33:42] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 1 ms to minimize.
[2024-05-29 03:33:42] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 1 ms to minimize.
[2024-05-29 03:33:43] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 1 ms to minimize.
[2024-05-29 03:33:43] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2024-05-29 03:33:43] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 1 ms to minimize.
[2024-05-29 03:33:44] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 1 ms to minimize.
[2024-05-29 03:33:44] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 1 ms to minimize.
[2024-05-29 03:33:44] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 0 ms to minimize.
[2024-05-29 03:33:45] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 1 ms to minimize.
[2024-05-29 03:33:45] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 0 ms to minimize.
[2024-05-29 03:33:45] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 1 ms to minimize.
[2024-05-29 03:33:46] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 0 ms to minimize.
[2024-05-29 03:33:46] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 1 ms to minimize.
[2024-05-29 03:33:46] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 1 ms to minimize.
[2024-05-29 03:33:47] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 0 ms to minimize.
[2024-05-29 03:33:47] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 0 ms to minimize.
[2024-05-29 03:33:47] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 1 ms to minimize.
[2024-05-29 03:33:48] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2024-05-29 03:33:48] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 1 ms to minimize.
[2024-05-29 03:33:48] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 0 ms to minimize.
[2024-05-29 03:33:49] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 0 ms to minimize.
[2024-05-29 03:33:49] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 0 ms to minimize.
[2024-05-29 03:33:49] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 1 ms to minimize.
[2024-05-29 03:33:49] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 1 ms to minimize.
[2024-05-29 03:33:50] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2024-05-29 03:33:50] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2024-05-29 03:33:50] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 0 ms to minimize.
[2024-05-29 03:33:50] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
[2024-05-29 03:33:51] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2024-05-29 03:33:51] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 0 ms to minimize.
[2024-05-29 03:33:51] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 1 ms to minimize.
[2024-05-29 03:33:51] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2024-05-29 03:33:51] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2024-05-29 03:33:52] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2024-05-29 03:33:52] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 1 ms to minimize.
[2024-05-29 03:33:52] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 0 ms to minimize.
[2024-05-29 03:33:52] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2024-05-29 03:33:52] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 0 ms to minimize.
[2024-05-29 03:33:53] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2024-05-29 03:33:53] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2024-05-29 03:33:53] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 0 ms to minimize.
[2024-05-29 03:33:53] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 0 ms to minimize.
[2024-05-29 03:33:53] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 0 ms to minimize.
[2024-05-29 03:33:53] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2024-05-29 03:33:54] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2024-05-29 03:33:54] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 16970 ms
[2024-05-29 03:33:54] [INFO ] After 17763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-29 03:33:54] [INFO ] After 18173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 1771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1771/1771 places, 1621/1621 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 1771 transition count 1263
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 1413 transition count 1262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 1412 transition count 1262
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 718 place count 1412 transition count 1021
Deduced a syphon composed of 241 places in 1 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1200 place count 1171 transition count 1021
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 2 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2216 place count 663 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2217 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 4 with 2 rules applied. Total rules applied 2219 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 4 with 178 rules applied. Total rules applied 2397 place count 573 transition count 570
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2398 place count 573 transition count 569
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2427 place count 573 transition count 569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2428 place count 572 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2430 place count 570 transition count 568
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2430 place count 570 transition count 567
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2432 place count 569 transition count 567
Applied a total of 2432 rules in 180 ms. Remains 569 /1771 variables (removed 1202) and now considering 567/1621 (removed 1054) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 569/1771 places, 567/1621 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 305565 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305565 steps, saw 195729 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 567 rows 569 cols
[2024-05-29 03:33:57] [INFO ] Computed 269 invariants in 11 ms
[2024-05-29 03:33:57] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:33:57] [INFO ] [Nat]Absence check using 269 positive place invariants in 42 ms returned sat
[2024-05-29 03:33:58] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 03:33:58] [INFO ] After 23ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:33:58] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 03:33:58] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 569/569 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2024-05-29 03:33:58] [INFO ] Invariant cache hit.
[2024-05-29 03:33:58] [INFO ] Implicit Places using invariants in 349 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 568/569 places, 567/567 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 567 transition count 566
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 567 transition count 566
Applied a total of 2 rules in 14 ms. Remains 567 /568 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 567 cols
[2024-05-29 03:33:58] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:33:58] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-29 03:33:58] [INFO ] Invariant cache hit.
[2024-05-29 03:33:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:33:59] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 567/569 places, 566/567 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1355 ms. Remains : 567/569 places, 566/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 315759 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 315759 steps, saw 202825 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:34:02] [INFO ] Invariant cache hit.
[2024-05-29 03:34:02] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:34:02] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:34:03] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:34:03] [INFO ] After 31ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:03] [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 24 ms.
[2024-05-29 03:34:03] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 8 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 567/567 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 7 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-05-29 03:34:03] [INFO ] Invariant cache hit.
[2024-05-29 03:34:03] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 03:34:03] [INFO ] Invariant cache hit.
[2024-05-29 03:34:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:34:04] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2024-05-29 03:34:04] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 03:34:04] [INFO ] Invariant cache hit.
[2024-05-29 03:34:04] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1328 ms. Remains : 567/567 places, 566/566 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 567 transition count 566
Applied a total of 61 rules in 16 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2024-05-29 03:34:04] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:34:04] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:34:04] [INFO ] [Nat]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:34:04] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:04] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-29 03:34:04] [INFO ] After 55ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:05] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-29 03:34:05] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 197 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 1771 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1770 transition count 1263
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 1413 transition count 1262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1412 transition count 1262
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 716 place count 1412 transition count 1021
Deduced a syphon composed of 241 places in 1 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1198 place count 1171 transition count 1021
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 1 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 3 with 1010 rules applied. Total rules applied 2208 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 2209 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 2211 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 2389 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2391 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2393 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2393 place count 572 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2395 place count 571 transition count 570
Applied a total of 2395 rules in 172 ms. Remains 571 /1771 variables (removed 1200) and now considering 570/1621 (removed 1051) transitions.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:34:05] [INFO ] Computed 269 invariants in 3 ms
[2024-05-29 03:34:05] [INFO ] Implicit Places using invariants in 338 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1771 places, 570/1621 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 13 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2024-05-29 03:34:06] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:34:06] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-29 03:34:06] [INFO ] Invariant cache hit.
[2024-05-29 03:34:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 03:34:06] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1771 places, 569/1621 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1532 ms. Remains : 569/1771 places, 569/1621 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/569 stabilizing places and 4/569 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:34:07] [INFO ] Invariant cache hit.
[2024-05-29 03:34:07] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:34:07] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2024-05-29 03:34:07] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 03:34:07] [INFO ] After 24ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:08] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 03:34:08] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 568 transition count 567
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 568 transition count 567
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 567 transition count 566
Applied a total of 6 rules in 24 ms. Remains 567 /569 variables (removed 2) and now considering 566/569 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 567/569 places, 566/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 333374 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333374 steps, saw 243870 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2024-05-29 03:34:11] [INFO ] Computed 268 invariants in 5 ms
[2024-05-29 03:34:11] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:34:11] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:34:11] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:34:11] [INFO ] After 23ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:11] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 03:34:11] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 9 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 567/567 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 9 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-05-29 03:34:11] [INFO ] Invariant cache hit.
[2024-05-29 03:34:12] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 03:34:12] [INFO ] Invariant cache hit.
[2024-05-29 03:34:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:34:12] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2024-05-29 03:34:12] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:34:12] [INFO ] Invariant cache hit.
[2024-05-29 03:34:13] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1340 ms. Remains : 567/567 places, 566/566 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 567 transition count 566
Applied a total of 61 rules in 15 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2024-05-29 03:34:13] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:34:13] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:34:13] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:34:13] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:34:13] [INFO ] After 23ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:34:13] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 03:34:13] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 327 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-07 finished in 43349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)&&F(p1))))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 141 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-29 03:34:14] [INFO ] Computed 271 invariants in 11 ms
[2024-05-29 03:34:14] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-29 03:34:14] [INFO ] Invariant cache hit.
[2024-05-29 03:34:16] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
[2024-05-29 03:34:16] [INFO ] Invariant cache hit.
[2024-05-29 03:34:17] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3338 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s211 1), p1:(EQ s1047 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 506 ms.
Stack based approach found an accepted trace after 859 steps with 0 reset with depth 860 and stack size 860 in 5 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-08 finished in 4085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&G(p1))||G(!p0)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1780 transition count 1271
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 1421 transition count 1271
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 718 place count 1421 transition count 1037
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1186 place count 1187 transition count 1037
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1193 place count 1180 transition count 1030
Iterating global reduction 2 with 7 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1023
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1214 place count 1173 transition count 1023
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2410 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2412 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2414 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2414 place count 572 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2416 place count 571 transition count 570
Applied a total of 2416 rules in 250 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:34:18] [INFO ] Computed 269 invariants in 4 ms
[2024-05-29 03:34:18] [INFO ] Implicit Places using invariants in 313 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 315 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 15 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2024-05-29 03:34:18] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:34:19] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-29 03:34:19] [INFO ] Invariant cache hit.
[2024-05-29 03:34:19] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1510 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s207 1), p0:(AND (EQ s196 1) (EQ s206 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 548 ms.
Product exploration explored 100000 steps with 1 reset in 738 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 5 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[p0, p0, p0, (AND (NOT p1) p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 179647 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179647 steps, saw 109097 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 03:34:25] [INFO ] Invariant cache hit.
[2024-05-29 03:34:25] [INFO ] [Real]Absence check using 268 positive place invariants in 42 ms returned sat
[2024-05-29 03:34:25] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:25] [INFO ] [Nat]Absence check using 268 positive place invariants in 42 ms returned sat
[2024-05-29 03:34:26] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:34:26] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-29 03:34:26] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Applied a total of 1 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 169567 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169567 steps, saw 106639 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2024-05-29 03:34:29] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:34:29] [INFO ] [Real]Absence check using 268 positive place invariants in 38 ms returned sat
[2024-05-29 03:34:30] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 03:34:30] [INFO ] After 269ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:30] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:30] [INFO ] [Nat]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:34:30] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:34:30] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-29 03:34:31] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 61 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 7 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-29 03:34:31] [INFO ] Invariant cache hit.
[2024-05-29 03:34:31] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-29 03:34:31] [INFO ] Invariant cache hit.
[2024-05-29 03:34:32] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2024-05-29 03:34:32] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:34:32] [INFO ] Invariant cache hit.
[2024-05-29 03:34:32] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1248 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 569 transition count 568
Applied a total of 59 rules in 16 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2024-05-29 03:34:32] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:34:32] [INFO ] [Real]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:34:32] [INFO ] After 238ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 03:34:32] [INFO ] After 274ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:32] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:33] [INFO ] [Nat]Absence check using 268 positive place invariants in 42 ms returned sat
[2024-05-29 03:34:33] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:34:33] [INFO ] After 498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-29 03:34:33] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 5 states, 20 edges and 2 AP (stutter insensitive) to 5 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[p0, p0, p0, (AND (NOT p1) p0), false]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, (AND (NOT p1) p0), false]
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 13 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2024-05-29 03:34:34] [INFO ] Computed 268 invariants in 10 ms
[2024-05-29 03:34:34] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-29 03:34:34] [INFO ] Invariant cache hit.
[2024-05-29 03:34:35] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2024-05-29 03:34:35] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:34:35] [INFO ] Invariant cache hit.
[2024-05-29 03:34:35] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1262 ms. Remains : 569/569 places, 569/569 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 5 states, 20 edges and 2 AP (stutter insensitive) to 5 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[p0, p0, p0, (AND (NOT p1) p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 178275 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178275 steps, saw 108229 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 03:34:39] [INFO ] Invariant cache hit.
[2024-05-29 03:34:39] [INFO ] [Real]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:34:39] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:39] [INFO ] [Nat]Absence check using 268 positive place invariants in 38 ms returned sat
[2024-05-29 03:34:40] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:34:40] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-29 03:34:40] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Applied a total of 1 rules in 14 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 181314 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181314 steps, saw 114759 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2024-05-29 03:34:43] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:34:44] [INFO ] [Real]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:34:44] [INFO ] After 234ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 03:34:44] [INFO ] After 270ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:44] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:44] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2024-05-29 03:34:44] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:34:44] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 121 ms.
[2024-05-29 03:34:45] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 75 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-29 03:34:45] [INFO ] Invariant cache hit.
[2024-05-29 03:34:45] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-29 03:34:45] [INFO ] Invariant cache hit.
[2024-05-29 03:34:46] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2024-05-29 03:34:46] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:34:46] [INFO ] Invariant cache hit.
[2024-05-29 03:34:46] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1241 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 569 transition count 568
Applied a total of 59 rules in 15 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2024-05-29 03:34:46] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:34:46] [INFO ] [Real]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:34:46] [INFO ] After 236ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 03:34:46] [INFO ] After 278ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:46] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:34:47] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:34:47] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:34:47] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-05-29 03:34:47] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 5 states, 20 edges and 2 AP (stutter insensitive) to 5 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[p0, p0, p0, (AND (NOT p1) p0), false]
Stuttering acceptance computed with spot in 206 ms :[p0, p0, p0, (AND (NOT p1) p0), false]
Stuttering acceptance computed with spot in 208 ms :[p0, p0, p0, (AND (NOT p1) p0), false]
Product exploration explored 100000 steps with 0 reset in 567 ms.
Product exploration explored 100000 steps with 1 reset in 704 ms.
Built C files in :
/tmp/ltsmin17977773757849598361
[2024-05-29 03:34:49] [INFO ] Computing symmetric may disable matrix : 569 transitions.
[2024-05-29 03:34:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:34:49] [INFO ] Computing symmetric may enable matrix : 569 transitions.
[2024-05-29 03:34:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:34:49] [INFO ] Computing Do-Not-Accords matrix : 569 transitions.
[2024-05-29 03:34:49] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:34:49] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17977773757849598361
Running compilation step : cd /tmp/ltsmin17977773757849598361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1578 ms.
Running link step : cd /tmp/ltsmin17977773757849598361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17977773757849598361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13729782237668943753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 13 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2024-05-29 03:35:04] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:35:05] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-29 03:35:05] [INFO ] Invariant cache hit.
[2024-05-29 03:35:05] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-29 03:35:05] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 03:35:05] [INFO ] Invariant cache hit.
[2024-05-29 03:35:06] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1216 ms. Remains : 569/569 places, 569/569 transitions.
Built C files in :
/tmp/ltsmin17132484495756388029
[2024-05-29 03:35:06] [INFO ] Computing symmetric may disable matrix : 569 transitions.
[2024-05-29 03:35:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:35:06] [INFO ] Computing symmetric may enable matrix : 569 transitions.
[2024-05-29 03:35:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:35:06] [INFO ] Computing Do-Not-Accords matrix : 569 transitions.
[2024-05-29 03:35:06] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:35:06] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17132484495756388029
Running compilation step : cd /tmp/ltsmin17132484495756388029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1338 ms.
Running link step : cd /tmp/ltsmin17132484495756388029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17132484495756388029;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9704552493141417197.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:35:21] [INFO ] Flatten gal took : 25 ms
[2024-05-29 03:35:21] [INFO ] Flatten gal took : 22 ms
[2024-05-29 03:35:21] [INFO ] Time to serialize gal into /tmp/LTL5422284007609706543.gal : 7 ms
[2024-05-29 03:35:21] [INFO ] Time to serialize properties into /tmp/LTL13460600935796147202.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5422284007609706543.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9553266087392529394.hoa' '-atoms' '/tmp/LTL13460600935796147202.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13460600935796147202.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9553266087392529394.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.12205e+36 deadlock states
3 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
549 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.5779,190768,1,0,148,1.0502e+06,36,143,15741,1.22992e+06,264
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-030B-LTLFireability-09 finished in 70157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1 U p2))&&X((!p3 U (p4||G(!p3)))))))'
Support contains 8 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 131 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-29 03:35:28] [INFO ] Computed 271 invariants in 10 ms
[2024-05-29 03:35:29] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-29 03:35:29] [INFO ] Invariant cache hit.
[2024-05-29 03:35:30] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2024-05-29 03:35:30] [INFO ] Invariant cache hit.
[2024-05-29 03:35:31] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3250 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (AND p3 (NOT p4))), (OR (NOT p2) (AND p3 (NOT p4))), true, (NOT p2), (NOT p2), (AND (NOT p4) p3)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(OR p2 p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s295 1), p1:(AND (EQ s578 1) (EQ s603 1) (EQ s612 1) (EQ s295 1)), p0:(EQ s1342 1), p4:(AND (NEQ s1184 1) (NOT (AND (EQ s508 1) (EQ s532 1)))), p3:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-10 finished in 3553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 136 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2024-05-29 03:35:32] [INFO ] Computed 271 invariants in 10 ms
[2024-05-29 03:35:32] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-29 03:35:32] [INFO ] Invariant cache hit.
[2024-05-29 03:35:34] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
[2024-05-29 03:35:34] [INFO ] Invariant cache hit.
[2024-05-29 03:35:35] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3199 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1427 1) (EQ s1082 1)), p0:(EQ s1651 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1490 reset in 265 ms.
Product exploration explored 100000 steps with 1521 reset in 289 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1772 stabilizing places and 478/1622 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
[2024-05-29 03:35:36] [INFO ] Invariant cache hit.
[2024-05-29 03:35:37] [INFO ] [Real]Absence check using 271 positive place invariants in 297 ms returned sat
[2024-05-29 03:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 03:35:45] [INFO ] [Real]Absence check using state equation in 8088 ms returned sat
[2024-05-29 03:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:35:46] [INFO ] [Nat]Absence check using 271 positive place invariants in 313 ms returned sat
[2024-05-29 03:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 03:35:54] [INFO ] [Nat]Absence check using state equation in 8193 ms returned sat
[2024-05-29 03:35:54] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-05-29 03:35:55] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2024-05-29 03:35:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
[2024-05-29 03:35:55] [INFO ] Computed and/alt/rep : 1621/2433/1621 causal constraints (skipped 0 transitions) in 96 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 03:36:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 2 out of 1772 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1772/1772 places, 1622/1622 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 1771 transition count 1263
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1413 transition count 1263
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 241 Pre rules applied. Total rules applied 716 place count 1413 transition count 1022
Deduced a syphon composed of 241 places in 1 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 2 with 482 rules applied. Total rules applied 1198 place count 1172 transition count 1022
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 1 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2208 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 2209 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 2211 place count 666 transition count 515
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2387 place count 578 transition count 572
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2389 place count 576 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2391 place count 574 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2391 place count 574 transition count 569
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 2393 place count 573 transition count 569
Applied a total of 2393 rules in 309 ms. Remains 573 /1772 variables (removed 1199) and now considering 569/1622 (removed 1053) transitions.
// Phase 1: matrix 569 rows 573 cols
[2024-05-29 03:36:00] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:36:01] [INFO ] Implicit Places using invariants in 378 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1772 places, 569/1622 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 568
Applied a total of 2 rules in 13 ms. Remains 571 /572 variables (removed 1) and now considering 568/569 (removed 1) transitions.
// Phase 1: matrix 568 rows 571 cols
[2024-05-29 03:36:01] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:01] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-29 03:36:01] [INFO ] Invariant cache hit.
[2024-05-29 03:36:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 03:36:02] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1772 places, 568/1622 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1897 ms. Remains : 571/1772 places, 568/1622 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/571 stabilizing places and 4/568 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2024-05-29 03:36:02] [INFO ] Invariant cache hit.
[2024-05-29 03:36:03] [INFO ] [Real]Absence check using 268 positive place invariants in 107 ms returned sat
[2024-05-29 03:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 03:36:03] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-29 03:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:36:04] [INFO ] [Nat]Absence check using 268 positive place invariants in 104 ms returned sat
[2024-05-29 03:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 03:36:04] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2024-05-29 03:36:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 03:36:05] [INFO ] [Nat]Added 12 Read/Feed constraints in 34 ms returned sat
[2024-05-29 03:36:05] [INFO ] Deduced a trap composed of 7 places in 384 ms of which 23 ms to minimize.
[2024-05-29 03:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2024-05-29 03:36:05] [INFO ] Computed and/alt/rep : 562/943/562 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-29 03:36:16] [INFO ] Added : 465 causal constraints over 93 iterations in 11004 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 2098 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-11 finished in 46610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 133 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2024-05-29 03:36:18] [INFO ] Computed 271 invariants in 8 ms
[2024-05-29 03:36:19] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-29 03:36:19] [INFO ] Invariant cache hit.
[2024-05-29 03:36:20] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
[2024-05-29 03:36:20] [INFO ] Invariant cache hit.
[2024-05-29 03:36:21] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3230 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1666 1) (EQ s1711 1)), p1:(AND (OR (NEQ s1666 1) (NEQ s1711 1)) (EQ s1361 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 179 reset in 447 ms.
Product exploration explored 100000 steps with 170 reset in 530 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:36:23] [INFO ] Invariant cache hit.
[2024-05-29 03:36:23] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 199 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
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 1771 transition count 1263
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1413 transition count 1263
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 716 place count 1413 transition count 1023
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 1196 place count 1173 transition count 1023
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 3 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2210 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2211 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 3 with 2 rules applied. Total rules applied 2213 place count 665 transition count 514
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2389 place count 577 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2391 place count 575 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2393 place count 573 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2393 place count 573 transition count 568
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2395 place count 572 transition count 568
Applied a total of 2395 rules in 179 ms. Remains 572 /1772 variables (removed 1200) and now considering 568/1622 (removed 1054) transitions.
// Phase 1: matrix 568 rows 572 cols
[2024-05-29 03:36:24] [INFO ] Computed 269 invariants in 1 ms
[2024-05-29 03:36:24] [INFO ] Implicit Places using invariants in 352 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 368 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1772 places, 568/1622 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 567
Applied a total of 2 rules in 14 ms. Remains 570 /571 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 570 cols
[2024-05-29 03:36:24] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:36:25] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-29 03:36:25] [INFO ] Invariant cache hit.
[2024-05-29 03:36:25] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1772 places, 567/1622 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1531 ms. Remains : 570/1772 places, 567/1622 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Finished random walk after 261 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=65 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering criterion allowed to conclude after 1337 steps with 60 reset in 7 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-12 finished in 8211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(!p1)||(!p1&&G(F(p2)))))'
Support contains 4 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 1780 transition count 1273
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 1 with 357 rules applied. Total rules applied 714 place count 1423 transition count 1273
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 714 place count 1423 transition count 1037
Deduced a syphon composed of 236 places in 2 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1186 place count 1187 transition count 1037
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1191 place count 1182 transition count 1032
Iterating global reduction 2 with 5 rules applied. Total rules applied 1196 place count 1182 transition count 1032
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1196 place count 1182 transition count 1027
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1206 place count 1177 transition count 1027
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 2224 place count 668 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2225 place count 668 transition count 517
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 2227 place count 667 transition count 516
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 2405 place count 578 transition count 575
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2407 place count 576 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2409 place count 574 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2409 place count 574 transition count 572
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 2411 place count 573 transition count 572
Applied a total of 2411 rules in 187 ms. Remains 573 /1781 variables (removed 1208) and now considering 572/1631 (removed 1059) transitions.
// Phase 1: matrix 572 rows 573 cols
[2024-05-29 03:36:26] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:36:27] [INFO ] Implicit Places using invariants in 373 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1781 places, 572/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 571
Applied a total of 2 rules in 14 ms. Remains 571 /572 variables (removed 1) and now considering 571/572 (removed 1) transitions.
// Phase 1: matrix 571 rows 571 cols
[2024-05-29 03:36:27] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:27] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-29 03:36:27] [INFO ] Invariant cache hit.
[2024-05-29 03:36:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:28] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1781 places, 571/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1613 ms. Remains : 571/1781 places, 571/1631 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) p1), true, (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s213 1), p1:(AND (EQ s14 1) (EQ s30 1)), p2:(EQ s550 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 513 ms.
Product exploration explored 100000 steps with 0 reset in 686 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/571 stabilizing places and 3/571 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 14 factoid took 833 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 03:36:31] [INFO ] Invariant cache hit.
[2024-05-29 03:36:31] [INFO ] [Real]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:36:31] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:36:31] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:36:32] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:32] [INFO ] After 115ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:32] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-05-29 03:36:32] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 571/571 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 570
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 571 transition count 570
Applied a total of 2 rules in 16 ms. Remains 571 /571 variables (removed 0) and now considering 570/571 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 571/571 places, 570/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 200995 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200995 steps, saw 128141 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:36:36] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:36] [INFO ] [Real]Absence check using 268 positive place invariants in 36 ms returned sat
[2024-05-29 03:36:36] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:36:36] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:36:37] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:37] [INFO ] After 121ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:37] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-29 03:36:37] [INFO ] After 930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 63 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.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 571/571 places, 570/570 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-29 03:36:37] [INFO ] Invariant cache hit.
[2024-05-29 03:36:37] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-29 03:36:37] [INFO ] Invariant cache hit.
[2024-05-29 03:36:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:38] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2024-05-29 03:36:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:36:38] [INFO ] Invariant cache hit.
[2024-05-29 03:36:38] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1307 ms. Remains : 571/571 places, 570/570 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 571 transition count 570
Applied a total of 61 rules in 15 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:36:38] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:36:39] [INFO ] [Real]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:36:39] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:36:39] [INFO ] [Nat]Absence check using 268 positive place invariants in 43 ms returned sat
[2024-05-29 03:36:39] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:39] [INFO ] After 120ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-29 03:36:40] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-29 03:36:40] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p2), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 1173 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 571/571 transitions.
Applied a total of 0 rules in 11 ms. Remains 571 /571 variables (removed 0) and now considering 571/571 (removed 0) transitions.
// Phase 1: matrix 571 rows 571 cols
[2024-05-29 03:36:41] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:42] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-29 03:36:42] [INFO ] Invariant cache hit.
[2024-05-29 03:36:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:42] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2024-05-29 03:36:42] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:36:42] [INFO ] Invariant cache hit.
[2024-05-29 03:36:43] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1271 ms. Remains : 571/571 places, 571/571 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/571 stabilizing places and 3/571 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X (X (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 15 factoid took 983 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 03:36:44] [INFO ] Invariant cache hit.
[2024-05-29 03:36:44] [INFO ] [Real]Absence check using 268 positive place invariants in 38 ms returned sat
[2024-05-29 03:36:45] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:36:45] [INFO ] [Nat]Absence check using 268 positive place invariants in 38 ms returned sat
[2024-05-29 03:36:45] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:45] [INFO ] After 118ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:46] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-29 03:36:46] [INFO ] After 906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 571/571 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 570
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 571 transition count 570
Applied a total of 2 rules in 17 ms. Remains 571 /571 variables (removed 0) and now considering 570/571 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 571/571 places, 570/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 181366 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181366 steps, saw 115207 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:36:49] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:36:49] [INFO ] [Real]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:36:50] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:36:50] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:36:50] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:50] [INFO ] After 120ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:50] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-29 03:36:51] [INFO ] After 919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 49 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.
Applied a total of 0 rules in 7 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 571/571 places, 570/570 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-29 03:36:51] [INFO ] Invariant cache hit.
[2024-05-29 03:36:51] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-29 03:36:51] [INFO ] Invariant cache hit.
[2024-05-29 03:36:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:52] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2024-05-29 03:36:52] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:36:52] [INFO ] Invariant cache hit.
[2024-05-29 03:36:52] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1275 ms. Remains : 571/571 places, 570/570 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 571 transition count 570
Applied a total of 61 rules in 15 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 570 rows 571 cols
[2024-05-29 03:36:52] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:36:52] [INFO ] [Real]Absence check using 268 positive place invariants in 40 ms returned sat
[2024-05-29 03:36:52] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:36:52] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:36:53] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:36:53] [INFO ] After 120ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-29 03:36:53] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 120 ms.
[2024-05-29 03:36:53] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X (X (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p2), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 1205 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 497 ms.
Product exploration explored 100000 steps with 0 reset in 656 ms.
Built C files in :
/tmp/ltsmin521053659656793275
[2024-05-29 03:36:56] [INFO ] Computing symmetric may disable matrix : 571 transitions.
[2024-05-29 03:36:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:36:56] [INFO ] Computing symmetric may enable matrix : 571 transitions.
[2024-05-29 03:36:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:36:56] [INFO ] Computing Do-Not-Accords matrix : 571 transitions.
[2024-05-29 03:36:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:36:56] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin521053659656793275
Running compilation step : cd /tmp/ltsmin521053659656793275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1423 ms.
Running link step : cd /tmp/ltsmin521053659656793275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin521053659656793275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8906034307757413331.hoa' '--buchi-type=spotba'
LTSmin run took 9968 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-030B-LTLFireability-13 finished in 41588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(F(p1))||p0)&&(p2||F(p1))))))'
Support contains 5 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1780 transition count 1271
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 1421 transition count 1271
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 718 place count 1421 transition count 1037
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1186 place count 1187 transition count 1037
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1192 place count 1181 transition count 1031
Iterating global reduction 2 with 6 rules applied. Total rules applied 1198 place count 1181 transition count 1031
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1198 place count 1181 transition count 1025
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1210 place count 1175 transition count 1025
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2224 place count 668 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2225 place count 668 transition count 517
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 2227 place count 667 transition count 516
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2405 place count 578 transition count 575
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2407 place count 576 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2409 place count 574 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2409 place count 574 transition count 572
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 2411 place count 573 transition count 572
Applied a total of 2411 rules in 203 ms. Remains 573 /1781 variables (removed 1208) and now considering 572/1631 (removed 1059) transitions.
// Phase 1: matrix 572 rows 573 cols
[2024-05-29 03:37:08] [INFO ] Computed 269 invariants in 3 ms
[2024-05-29 03:37:08] [INFO ] Implicit Places using invariants in 315 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 318 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1781 places, 572/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 571
Applied a total of 2 rules in 13 ms. Remains 571 /572 variables (removed 1) and now considering 571/572 (removed 1) transitions.
// Phase 1: matrix 571 rows 571 cols
[2024-05-29 03:37:08] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:37:09] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-29 03:37:09] [INFO ] Invariant cache hit.
[2024-05-29 03:37:09] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1781 places, 571/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1434 ms. Remains : 571/1781 places, 571/1631 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s542 0) (EQ s552 0)), p2:(EQ s475 1), p1:(AND (EQ s509 1) (EQ s525 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-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-14 finished in 1534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 151 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-29 03:37:10] [INFO ] Computed 271 invariants in 10 ms
[2024-05-29 03:37:10] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-29 03:37:10] [INFO ] Invariant cache hit.
[2024-05-29 03:37:12] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2024-05-29 03:37:12] [INFO ] Invariant cache hit.
[2024-05-29 03:37:13] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3369 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s751 1), p0:(NEQ s867 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 520 ms.
Stack based approach found an accepted trace after 801 steps with 0 reset with depth 802 and stack size 802 in 5 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-15 finished in 4040 ms.
All properties solved by simple procedures.
Total runtime 294668 ms.

BK_STOP 1716953834908

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788700188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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