Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679436433149

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:07:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:07:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:07:16] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-21 22:07:16] [INFO ] Transformed 1403 places.
[2023-03-21 22:07:16] [INFO ] Transformed 1303 transitions.
[2023-03-21 22:07:16] [INFO ] Found NUPN structural information;
[2023-03-21 22:07:16] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-020B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 211 places :
Symmetric choice reduction at 0 with 211 rule applications. Total rules 211 place count 1192 transition count 1092
Iterating global reduction 0 with 211 rules applied. Total rules applied 422 place count 1192 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 423 place count 1191 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 424 place count 1191 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1190 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1190 transition count 1090
Applied a total of 426 rules in 552 ms. Remains 1190 /1403 variables (removed 213) and now considering 1090/1303 (removed 213) transitions.
// Phase 1: matrix 1090 rows 1190 cols
[2023-03-21 22:07:17] [INFO ] Computed 181 place invariants in 28 ms
[2023-03-21 22:07:18] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2023-03-21 22:07:18] [INFO ] Invariant cache hit.
[2023-03-21 22:07:19] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2799 ms to find 0 implicit places.
[2023-03-21 22:07:19] [INFO ] Invariant cache hit.
[2023-03-21 22:07:20] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1190/1403 places, 1090/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4373 ms. Remains : 1190/1403 places, 1090/1303 transitions.
Support contains 40 out of 1190 places after structural reductions.
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 138 ms
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 108 ms
[2023-03-21 22:07:21] [INFO ] Input system was already deterministic with 1090 transitions.
Support contains 37 out of 1190 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 22:07:22] [INFO ] Invariant cache hit.
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using 181 positive place invariants in 150 ms returned sat
[2023-03-21 22:07:23] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 181 positive place invariants in 92 ms returned sat
[2023-03-21 22:07:25] [INFO ] After 1410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 22:07:25] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 18 ms to minimize.
[2023-03-21 22:07:26] [INFO ] Deduced a trap composed of 20 places in 600 ms of which 1 ms to minimize.
[2023-03-21 22:07:27] [INFO ] Deduced a trap composed of 22 places in 601 ms of which 2 ms to minimize.
[2023-03-21 22:07:27] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 1 ms to minimize.
[2023-03-21 22:07:28] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 22 ms to minimize.
[2023-03-21 22:07:28] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 1 ms to minimize.
[2023-03-21 22:07:28] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2023-03-21 22:07:28] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2023-03-21 22:07:28] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2023-03-21 22:07:29] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2023-03-21 22:07:29] [INFO ] Deduced a trap composed of 24 places in 353 ms of which 16 ms to minimize.
[2023-03-21 22:07:29] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 14 ms to minimize.
[2023-03-21 22:07:30] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 1 ms to minimize.
[2023-03-21 22:07:30] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2023-03-21 22:07:30] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 1 ms to minimize.
[2023-03-21 22:07:31] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 1 ms to minimize.
[2023-03-21 22:07:31] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 1 ms to minimize.
[2023-03-21 22:07:31] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 2 ms to minimize.
[2023-03-21 22:07:31] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 1 ms to minimize.
[2023-03-21 22:07:32] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2023-03-21 22:07:32] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 1 ms to minimize.
[2023-03-21 22:07:32] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 2 ms to minimize.
[2023-03-21 22:07:32] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7340 ms
[2023-03-21 22:07:33] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2023-03-21 22:07:33] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 1 ms to minimize.
[2023-03-21 22:07:33] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2023-03-21 22:07:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 572 ms
[2023-03-21 22:07:33] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2023-03-21 22:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-21 22:07:33] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2023-03-21 22:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-21 22:07:34] [INFO ] After 10288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 615 ms.
[2023-03-21 22:07:34] [INFO ] After 11775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 14 out of 1190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1190 transition count 856
Reduce places removed 234 places and 0 transitions.
Iterating post reduction 1 with 234 rules applied. Total rules applied 468 place count 956 transition count 856
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 468 place count 956 transition count 704
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 772 place count 804 transition count 704
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 775 place count 801 transition count 701
Iterating global reduction 2 with 3 rules applied. Total rules applied 778 place count 801 transition count 701
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 778 place count 801 transition count 698
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 784 place count 798 transition count 698
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 0 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 1470 place count 455 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1471 place count 455 transition count 354
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 1473 place count 454 transition count 353
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1585 place count 398 transition count 388
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1586 place count 398 transition count 387
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1588 place count 398 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1590 place count 396 transition count 385
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1610 place count 396 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1611 place count 395 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1613 place count 393 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1613 place count 393 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1615 place count 392 transition count 383
Applied a total of 1615 rules in 323 ms. Remains 392 /1190 variables (removed 798) and now considering 383/1090 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 392/1190 places, 383/1090 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 383 rows 392 cols
[2023-03-21 22:07:36] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-21 22:07:36] [INFO ] [Real]Absence check using 179 positive place invariants in 27 ms returned sat
[2023-03-21 22:07:36] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 22:07:36] [INFO ] [Nat]Absence check using 179 positive place invariants in 37 ms returned sat
[2023-03-21 22:07:36] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 22:07:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:07:37] [INFO ] After 227ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-21 22:07:37] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-21 22:07:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-21 22:07:37] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-21 22:07:37] [INFO ] After 1507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 13 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 383/383 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 392 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 391 transition count 382
Applied a total of 2 rules in 22 ms. Remains 391 /392 variables (removed 1) and now considering 382/383 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 391/392 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 382 rows 391 cols
[2023-03-21 22:07:38] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:07:38] [INFO ] [Real]Absence check using 179 positive place invariants in 22 ms returned sat
[2023-03-21 22:07:38] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:07:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:07:38] [INFO ] After 91ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:07:38] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:07:38] [INFO ] [Nat]Absence check using 179 positive place invariants in 21 ms returned sat
[2023-03-21 22:07:38] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:07:38] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:07:38] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-21 22:07:39] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2023-03-21 22:07:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2023-03-21 22:07:39] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-21 22:07:39] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 382/382 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 391 transition count 378
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 387 transition count 378
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 387 transition count 374
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 383 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 382 transition count 373
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 381 transition count 375
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 380 transition count 374
Applied a total of 21 rules in 54 ms. Remains 380 /391 variables (removed 11) and now considering 374/382 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 380/391 places, 374/382 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426269 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426269 steps, saw 276318 distinct states, run finished after 3079 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 380 cols
[2023-03-21 22:07:42] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:07:42] [INFO ] [Real]Absence check using 179 positive place invariants in 83 ms returned sat
[2023-03-21 22:07:42] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:07:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:07:42] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:07:42] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:07:42] [INFO ] [Nat]Absence check using 179 positive place invariants in 44 ms returned sat
[2023-03-21 22:07:43] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:07:43] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:07:43] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-21 22:07:43] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 374/374 transitions.
Applied a total of 0 rules in 15 ms. Remains 380 /380 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 380/380 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 374/374 transitions.
Applied a total of 0 rules in 27 ms. Remains 380 /380 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-21 22:07:43] [INFO ] Invariant cache hit.
[2023-03-21 22:07:44] [INFO ] Implicit Places using invariants in 1003 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/380 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 378 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 378 transition count 373
Applied a total of 2 rules in 27 ms. Remains 378 /379 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 378 cols
[2023-03-21 22:07:44] [INFO ] Computed 178 place invariants in 5 ms
[2023-03-21 22:07:45] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2023-03-21 22:07:45] [INFO ] Invariant cache hit.
[2023-03-21 22:07:46] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 2482 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 378/380 places, 373/374 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3543 ms. Remains : 378/380 places, 373/374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 465381 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 465381 steps, saw 301696 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:07:49] [INFO ] Invariant cache hit.
[2023-03-21 22:07:49] [INFO ] [Real]Absence check using 178 positive place invariants in 81 ms returned sat
[2023-03-21 22:07:50] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:07:50] [INFO ] After 179ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:07:50] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:07:50] [INFO ] [Nat]Absence check using 178 positive place invariants in 18 ms returned sat
[2023-03-21 22:07:50] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:07:50] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-21 22:07:50] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 373/373 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 378/378 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 373/373 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2023-03-21 22:07:50] [INFO ] Invariant cache hit.
[2023-03-21 22:07:50] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-21 22:07:50] [INFO ] Invariant cache hit.
[2023-03-21 22:07:51] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-21 22:07:51] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-21 22:07:51] [INFO ] Invariant cache hit.
[2023-03-21 22:07:51] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1272 ms. Remains : 378/378 places, 373/373 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 378 transition count 373
Applied a total of 38 rules in 13 ms. Remains 378 /378 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 378 cols
[2023-03-21 22:07:51] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-21 22:07:51] [INFO ] [Real]Absence check using 178 positive place invariants in 20 ms returned sat
[2023-03-21 22:07:52] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:07:52] [INFO ] [Nat]Absence check using 178 positive place invariants in 35 ms returned sat
[2023-03-21 22:07:52] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:07:52] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-21 22:07:52] [INFO ] After 69ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:07:52] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-21 22:07:52] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldIIPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 319 stabilizing places and 319 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F((p1||G(p2))))))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1189 transition count 851
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 951 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 478 place count 950 transition count 850
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 478 place count 950 transition count 696
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 786 place count 796 transition count 696
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 791 place count 791 transition count 691
Iterating global reduction 3 with 5 rules applied. Total rules applied 796 place count 791 transition count 691
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 796 place count 791 transition count 686
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 806 place count 786 transition count 686
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 1486 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1487 place count 446 transition count 345
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 1489 place count 445 transition count 344
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1603 place count 388 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1605 place count 386 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1607 place count 384 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1607 place count 384 transition count 377
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 1609 place count 383 transition count 377
Applied a total of 1609 rules in 156 ms. Remains 383 /1190 variables (removed 807) and now considering 377/1090 (removed 713) transitions.
// Phase 1: matrix 377 rows 383 cols
[2023-03-21 22:07:53] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:07:53] [INFO ] Implicit Places using invariants in 346 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 369 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/1190 places, 377/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 376
Applied a total of 2 rules in 33 ms. Remains 381 /382 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 381 cols
[2023-03-21 22:07:53] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:07:54] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-21 22:07:54] [INFO ] Invariant cache hit.
[2023-03-21 22:07:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:07:57] [INFO ] Implicit Places using invariants and state equation in 2994 ms returned []
Implicit Place search using SMT with State Equation took 3434 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 381/1190 places, 376/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3993 ms. Remains : 381/1190 places, 376/1090 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s269 1), p1:(EQ s292 1), p2:(EQ s60 1)], nbAcceptance=2, 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 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-00 finished in 4387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(X(p0)) U p1)&&F(X((X(p0) U p2))))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1189 transition count 848
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 948 transition count 848
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 482 place count 948 transition count 693
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 792 place count 793 transition count 693
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 795 place count 790 transition count 690
Iterating global reduction 2 with 3 rules applied. Total rules applied 798 place count 790 transition count 690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 798 place count 790 transition count 687
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 804 place count 787 transition count 687
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1486 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1487 place count 446 transition count 345
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 1489 place count 445 transition count 344
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1607 place count 386 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1609 place count 384 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1611 place count 382 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 380
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 1613 place count 381 transition count 380
Applied a total of 1613 rules in 154 ms. Remains 381 /1190 variables (removed 809) and now considering 380/1090 (removed 710) transitions.
// Phase 1: matrix 380 rows 381 cols
[2023-03-21 22:07:57] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-21 22:07:57] [INFO ] Implicit Places using invariants in 245 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1190 places, 380/1090 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 379 transition count 379
Applied a total of 2 rules in 11 ms. Remains 379 /380 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 379 cols
[2023-03-21 22:07:57] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:07:58] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-21 22:07:58] [INFO ] Invariant cache hit.
[2023-03-21 22:07:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:07:59] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1190 places, 379/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2157 ms. Remains : 379/1190 places, 379/1090 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s374 1), p2:(EQ s262 1), p0:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-01 finished in 2406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 93 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:07:59] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-21 22:08:00] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-21 22:08:00] [INFO ] Invariant cache hit.
[2023-03-21 22:08:02] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
[2023-03-21 22:08:02] [INFO ] Invariant cache hit.
[2023-03-21 22:08:03] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3150 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s878 1), p1:(EQ s234 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 505 ms.
Stack based approach found an accepted trace after 1430 steps with 0 reset with depth 1431 and stack size 1431 in 8 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-02 finished in 3802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 119 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:08:03] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-21 22:08:04] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-21 22:08:04] [INFO ] Invariant cache hit.
[2023-03-21 22:08:06] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
[2023-03-21 22:08:06] [INFO ] Invariant cache hit.
[2023-03-21 22:08:07] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3810 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-04 finished in 3956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||F(p2)))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 98 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:08:07] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-21 22:08:08] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-21 22:08:08] [INFO ] Invariant cache hit.
[2023-03-21 22:08:09] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2023-03-21 22:08:09] [INFO ] Invariant cache hit.
[2023-03-21 22:08:10] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2788 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s304 1) (EQ s501 1)), p2:(EQ s304 1), p1:(EQ s338 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 312 reset in 371 ms.
Product exploration explored 100000 steps with 312 reset in 603 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p2)]
Finished random walk after 307 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=307 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 433 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2)]
[2023-03-21 22:08:12] [INFO ] Invariant cache hit.
[2023-03-21 22:08:14] [INFO ] [Real]Absence check using 181 positive place invariants in 154 ms returned sat
[2023-03-21 22:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:17] [INFO ] [Real]Absence check using state equation in 3829 ms returned sat
[2023-03-21 22:08:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:18] [INFO ] [Nat]Absence check using 181 positive place invariants in 168 ms returned sat
[2023-03-21 22:08:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:22] [INFO ] [Nat]Absence check using state equation in 3285 ms returned sat
[2023-03-21 22:08:22] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2023-03-21 22:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-21 22:08:22] [INFO ] Computed and/alt/rep : 1081/1622/1081 causal constraints (skipped 0 transitions) in 94 ms.
[2023-03-21 22:08:32] [INFO ] Added : 520 causal constraints over 104 iterations in 10691 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 1 out of 1182 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 : 1182/1182 places, 1082/1082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1181 transition count 844
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 944 transition count 844
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 474 place count 944 transition count 683
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1470 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1471 place count 446 transition count 345
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 1473 place count 445 transition count 344
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1591 place count 386 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1593 place count 384 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1595 place count 382 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1595 place count 382 transition count 380
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 1597 place count 381 transition count 380
Applied a total of 1597 rules in 95 ms. Remains 381 /1182 variables (removed 801) and now considering 380/1082 (removed 702) transitions.
// Phase 1: matrix 380 rows 381 cols
[2023-03-21 22:08:33] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:08:33] [INFO ] Implicit Places using invariants in 228 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1182 places, 380/1082 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 379 transition count 379
Applied a total of 2 rules in 8 ms. Remains 379 /380 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 379 cols
[2023-03-21 22:08:33] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-21 22:08:33] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-21 22:08:33] [INFO ] Invariant cache hit.
[2023-03-21 22:08:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:08:34] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1182 places, 379/1082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1168 ms. Remains : 379/1182 places, 379/1082 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/379 stabilizing places and 2/379 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 210 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 99 ms :[(NOT p2)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 299 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 51 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p2)]
[2023-03-21 22:08:34] [INFO ] Invariant cache hit.
[2023-03-21 22:08:35] [INFO ] [Real]Absence check using 178 positive place invariants in 51 ms returned sat
[2023-03-21 22:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:35] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2023-03-21 22:08:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:36] [INFO ] [Nat]Absence check using 178 positive place invariants in 60 ms returned sat
[2023-03-21 22:08:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:36] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-21 22:08:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:08:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 9 ms returned sat
[2023-03-21 22:08:36] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-03-21 22:08:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-21 22:08:36] [INFO ] Computed and/alt/rep : 374/579/374 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-21 22:08:38] [INFO ] Added : 287 causal constraints over 58 iterations in 2135 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 31 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-05 finished in 31367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 129 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:08:39] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-21 22:08:39] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-21 22:08:39] [INFO ] Invariant cache hit.
[2023-03-21 22:08:41] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2023-03-21 22:08:41] [INFO ] Invariant cache hit.
[2023-03-21 22:08:42] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3211 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s77 1) (NEQ s536 1)), p0:(NEQ s536 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 400 ms.
Product exploration explored 100000 steps with 0 reset in 592 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 381 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 422 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 459 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 61 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2023-03-21 22:08:44] [INFO ] Invariant cache hit.
[2023-03-21 22:08:45] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-21 22:08:45] [INFO ] Invariant cache hit.
[2023-03-21 22:08:46] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-21 22:08:46] [INFO ] Invariant cache hit.
[2023-03-21 22:08:47] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2708 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 254 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 462 ms.
Product exploration explored 100000 steps with 0 reset in 552 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1182 transition count 1082
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 237 place count 1182 transition count 1144
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 319 place count 1182 transition count 1144
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 718 places in 1 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 718 place count 1182 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 719 place count 1182 transition count 1143
Renaming transitions due to excessive name length > 1024 char.
Discarding 158 places :
Symmetric choice reduction at 2 with 158 rule applications. Total rules 877 place count 1024 transition count 985
Deduced a syphon composed of 560 places in 0 ms
Iterating global reduction 2 with 158 rules applied. Total rules applied 1035 place count 1024 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 561 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1036 place count 1024 transition count 985
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1038 place count 1022 transition count 983
Deduced a syphon composed of 559 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1040 place count 1022 transition count 983
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 637 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1118 place count 1022 transition count 1398
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1196 place count 944 transition count 1242
Deduced a syphon composed of 559 places in 2 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1274 place count 944 transition count 1242
Deduced a syphon composed of 559 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1283 place count 944 transition count 1233
Deduced a syphon composed of 559 places in 1 ms
Applied a total of 1283 rules in 745 ms. Remains 944 /1182 variables (removed 238) and now considering 1233/1082 (removed -151) transitions.
[2023-03-21 22:08:50] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 1233 rows 944 cols
[2023-03-21 22:08:50] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-21 22:08:51] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 944/1182 places, 1233/1082 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1558 ms. Remains : 944/1182 places, 1233/1082 transitions.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 34 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:08:51] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-21 22:08:51] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-21 22:08:51] [INFO ] Invariant cache hit.
[2023-03-21 22:08:53] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2023-03-21 22:08:53] [INFO ] Invariant cache hit.
[2023-03-21 22:08:54] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2655 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-06 finished in 15152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1 U p2)))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 70 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-21 22:08:54] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-21 22:08:54] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-21 22:08:54] [INFO ] Invariant cache hit.
[2023-03-21 22:08:55] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2023-03-21 22:08:55] [INFO ] Invariant cache hit.
[2023-03-21 22:08:56] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2308 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(NEQ s251 1), p2:(AND (EQ s1116 1) (NEQ s251 1)), p1:(EQ s1116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1012 ms.
Product exploration explored 100000 steps with 50000 reset in 960 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1181 stabilizing places and 318/1081 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-07 finished in 4764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!X(p0) U p1))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 62 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
[2023-03-21 22:08:58] [INFO ] Invariant cache hit.
[2023-03-21 22:08:59] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-21 22:08:59] [INFO ] Invariant cache hit.
[2023-03-21 22:09:01] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2023-03-21 22:09:01] [INFO ] Invariant cache hit.
[2023-03-21 22:09:02] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3156 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1078 1) (EQ s1102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 160 reset in 435 ms.
Stack based approach found an accepted trace after 4347 steps with 6 reset with depth 470 and stack size 470 in 19 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-08 finished in 3744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(X(X(G(p1))))))))'
Support contains 4 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 60 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
[2023-03-21 22:09:02] [INFO ] Invariant cache hit.
[2023-03-21 22:09:03] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-21 22:09:03] [INFO ] Invariant cache hit.
[2023-03-21 22:09:03] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2023-03-21 22:09:03] [INFO ] Invariant cache hit.
[2023-03-21 22:09:04] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2053 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=1, aps=[p0:(OR (EQ s507 0) (EQ s518 0) (EQ s544 0)), p1:(NEQ s1069 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 969 ms.
Product exploration explored 100000 steps with 50000 reset in 909 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1181 stabilizing places and 318/1081 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-10 finished in 4475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1189 transition count 850
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 950 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 480 place count 949 transition count 694
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 790 place count 794 transition count 694
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 795 place count 789 transition count 689
Iterating global reduction 3 with 5 rules applied. Total rules applied 800 place count 789 transition count 689
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 800 place count 789 transition count 684
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 810 place count 784 transition count 684
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1488 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1489 place count 445 transition count 344
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 1491 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1607 place count 386 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1609 place count 384 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1611 place count 382 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 378
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 1613 place count 381 transition count 378
Applied a total of 1613 rules in 140 ms. Remains 381 /1190 variables (removed 809) and now considering 378/1090 (removed 712) transitions.
// Phase 1: matrix 378 rows 381 cols
[2023-03-21 22:09:07] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:09:07] [INFO ] Implicit Places using invariants in 325 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1190 places, 378/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 377
Applied a total of 2 rules in 35 ms. Remains 379 /380 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 379 cols
[2023-03-21 22:09:07] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:09:07] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-21 22:09:07] [INFO ] Invariant cache hit.
[2023-03-21 22:09:08] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1190 places, 377/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1384 ms. Remains : 379/1190 places, 377/1090 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s271 1), p1:(EQ s210 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-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-11 finished in 1608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p0)))))'
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 113 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:09:08] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-21 22:09:09] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-21 22:09:09] [INFO ] Invariant cache hit.
[2023-03-21 22:09:10] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2023-03-21 22:09:10] [INFO ] Invariant cache hit.
[2023-03-21 22:09:11] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2778 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, p0, true, p0]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 457 ms.
Product exploration explored 100000 steps with 0 reset in 543 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288758 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288758 steps, saw 147093 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:09:16] [INFO ] Invariant cache hit.
[2023-03-21 22:09:16] [INFO ] [Real]Absence check using 181 positive place invariants in 40 ms returned sat
[2023-03-21 22:09:17] [INFO ] After 661ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:09:17] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 0 ms to minimize.
[2023-03-21 22:09:17] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 13 ms to minimize.
[2023-03-21 22:09:18] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 1 ms to minimize.
[2023-03-21 22:09:18] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2023-03-21 22:09:18] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 13 ms to minimize.
[2023-03-21 22:09:19] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 1 ms to minimize.
[2023-03-21 22:09:19] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 0 ms to minimize.
[2023-03-21 22:09:19] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 0 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 1 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2023-03-21 22:09:20] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 1 ms to minimize.
[2023-03-21 22:09:21] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 18 ms to minimize.
[2023-03-21 22:09:21] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 0 ms to minimize.
[2023-03-21 22:09:21] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 1 ms to minimize.
[2023-03-21 22:09:27] [INFO ] Deduced a trap composed of 31 places in 6248 ms of which 1 ms to minimize.
[2023-03-21 22:09:29] [INFO ] Deduced a trap composed of 31 places in 1051 ms of which 1 ms to minimize.
[2023-03-21 22:09:29] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 13 ms to minimize.
[2023-03-21 22:09:29] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 0 ms to minimize.
[2023-03-21 22:09:29] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2023-03-21 22:09:30] [INFO ] Deduced a trap composed of 34 places in 313 ms of which 0 ms to minimize.
[2023-03-21 22:09:30] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 1 ms to minimize.
[2023-03-21 22:09:30] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2023-03-21 22:09:30] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 25 ms to minimize.
[2023-03-21 22:09:30] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 13614 ms
[2023-03-21 22:09:30] [INFO ] After 14331ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:09:30] [INFO ] After 14611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:09:31] [INFO ] [Nat]Absence check using 181 positive place invariants in 161 ms returned sat
[2023-03-21 22:09:31] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:09:32] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 1 ms to minimize.
[2023-03-21 22:09:32] [INFO ] Deduced a trap composed of 27 places in 314 ms of which 0 ms to minimize.
[2023-03-21 22:09:32] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 0 ms to minimize.
[2023-03-21 22:09:33] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 18 ms to minimize.
[2023-03-21 22:09:33] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 1 ms to minimize.
[2023-03-21 22:09:33] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 16 ms to minimize.
[2023-03-21 22:09:34] [INFO ] Deduced a trap composed of 34 places in 370 ms of which 17 ms to minimize.
[2023-03-21 22:09:34] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 31 ms to minimize.
[2023-03-21 22:09:34] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 0 ms to minimize.
[2023-03-21 22:09:35] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 1 ms to minimize.
[2023-03-21 22:09:35] [INFO ] Deduced a trap composed of 32 places in 505 ms of which 1 ms to minimize.
[2023-03-21 22:09:36] [INFO ] Deduced a trap composed of 32 places in 355 ms of which 0 ms to minimize.
[2023-03-21 22:09:36] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 0 ms to minimize.
[2023-03-21 22:09:36] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 0 ms to minimize.
[2023-03-21 22:09:37] [INFO ] Deduced a trap composed of 32 places in 413 ms of which 0 ms to minimize.
[2023-03-21 22:09:37] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 1 ms to minimize.
[2023-03-21 22:09:37] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 0 ms to minimize.
[2023-03-21 22:09:37] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2023-03-21 22:09:38] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 0 ms to minimize.
[2023-03-21 22:09:38] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2023-03-21 22:09:38] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 0 ms to minimize.
[2023-03-21 22:09:38] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 0 ms to minimize.
[2023-03-21 22:09:39] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 0 ms to minimize.
[2023-03-21 22:09:39] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 0 ms to minimize.
[2023-03-21 22:09:39] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2023-03-21 22:09:39] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 0 ms to minimize.
[2023-03-21 22:09:39] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7814 ms
[2023-03-21 22:09:39] [INFO ] After 8512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-21 22:09:39] [INFO ] After 9122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 843
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 478 place count 943 transition count 683
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 798 place count 783 transition count 683
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
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 1483 place count 441 transition count 340
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1599 place count 383 transition count 378
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 383 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1601 place count 383 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1602 place count 382 transition count 376
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1622 place count 382 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1623 place count 381 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1625 place count 379 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 374
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 1627 place count 378 transition count 374
Applied a total of 1627 rules in 132 ms. Remains 378 /1182 variables (removed 804) and now considering 374/1082 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 378/1182 places, 374/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 528009 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 528009 steps, saw 339028 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2023-03-21 22:09:43] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-21 22:09:43] [INFO ] [Real]Absence check using 179 positive place invariants in 35 ms returned sat
[2023-03-21 22:09:43] [INFO ] After 178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:09:43] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:09:43] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:09:43] [INFO ] [Nat]Absence check using 179 positive place invariants in 37 ms returned sat
[2023-03-21 22:09:43] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:09:43] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:09:43] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-21 22:09:43] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 18 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 35 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-21 22:09:44] [INFO ] Invariant cache hit.
[2023-03-21 22:09:44] [INFO ] Implicit Places using invariants in 325 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 373
Applied a total of 2 rules in 8 ms. Remains 376 /377 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 376 cols
[2023-03-21 22:09:44] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:09:44] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-21 22:09:44] [INFO ] Invariant cache hit.
[2023-03-21 22:09:45] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 373/374 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1023 ms. Remains : 376/378 places, 373/374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 503566 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 503566 steps, saw 324578 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:09:48] [INFO ] Invariant cache hit.
[2023-03-21 22:09:48] [INFO ] [Real]Absence check using 178 positive place invariants in 106 ms returned sat
[2023-03-21 22:09:49] [INFO ] After 1298ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:09:49] [INFO ] After 1344ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-21 22:09:49] [INFO ] After 1591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 376/376 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 14 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2023-03-21 22:09:49] [INFO ] Invariant cache hit.
[2023-03-21 22:09:50] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-21 22:09:50] [INFO ] Invariant cache hit.
[2023-03-21 22:09:50] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-03-21 22:09:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 22:09:50] [INFO ] Invariant cache hit.
[2023-03-21 22:09:51] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1671 ms. Remains : 376/376 places, 373/373 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 373
Applied a total of 39 rules in 21 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 376 cols
[2023-03-21 22:09:51] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:09:51] [INFO ] [Real]Absence check using 178 positive place invariants in 481 ms returned sat
[2023-03-21 22:09:52] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:09:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-21 22:09:52] [INFO ] After 39ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:09:52] [INFO ] After 903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:09:52] [INFO ] [Nat]Absence check using 178 positive place invariants in 153 ms returned sat
[2023-03-21 22:09:53] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:09:53] [INFO ] After 26ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:09:53] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-21 22:09:53] [INFO ] After 1059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0]
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 76 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:09:53] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-21 22:09:54] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-21 22:09:54] [INFO ] Invariant cache hit.
[2023-03-21 22:09:56] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
[2023-03-21 22:09:56] [INFO ] Invariant cache hit.
[2023-03-21 22:09:56] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3157 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278031 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278031 steps, saw 142075 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:10:00] [INFO ] Invariant cache hit.
[2023-03-21 22:10:00] [INFO ] [Real]Absence check using 181 positive place invariants in 148 ms returned sat
[2023-03-21 22:10:01] [INFO ] After 597ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:10:01] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 0 ms to minimize.
[2023-03-21 22:10:02] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 2 ms to minimize.
[2023-03-21 22:10:02] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 2 ms to minimize.
[2023-03-21 22:10:02] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 1 ms to minimize.
[2023-03-21 22:10:03] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 1 ms to minimize.
[2023-03-21 22:10:03] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2023-03-21 22:10:03] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-21 22:10:04] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 0 ms to minimize.
[2023-03-21 22:10:04] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 1 ms to minimize.
[2023-03-21 22:10:04] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2023-03-21 22:10:04] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 1 ms to minimize.
[2023-03-21 22:10:05] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 1 ms to minimize.
[2023-03-21 22:10:05] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 1 ms to minimize.
[2023-03-21 22:10:05] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2023-03-21 22:10:05] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2023-03-21 22:10:06] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 1 ms to minimize.
[2023-03-21 22:10:06] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 1 ms to minimize.
[2023-03-21 22:10:07] [INFO ] Deduced a trap composed of 29 places in 1131 ms of which 1 ms to minimize.
[2023-03-21 22:10:07] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 27 places in 345 ms of which 1 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2023-03-21 22:10:08] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 1 ms to minimize.
[2023-03-21 22:10:09] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 1 ms to minimize.
[2023-03-21 22:10:09] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 1 ms to minimize.
[2023-03-21 22:10:09] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8060 ms
[2023-03-21 22:10:09] [INFO ] After 8738ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:09] [INFO ] After 9134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:09] [INFO ] [Nat]Absence check using 181 positive place invariants in 74 ms returned sat
[2023-03-21 22:10:10] [INFO ] After 746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:11] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2023-03-21 22:10:11] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 1 ms to minimize.
[2023-03-21 22:10:11] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 1 ms to minimize.
[2023-03-21 22:10:11] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2023-03-21 22:10:12] [INFO ] Deduced a trap composed of 26 places in 370 ms of which 0 ms to minimize.
[2023-03-21 22:10:12] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 1 ms to minimize.
[2023-03-21 22:10:13] [INFO ] Deduced a trap composed of 34 places in 367 ms of which 0 ms to minimize.
[2023-03-21 22:10:13] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 0 ms to minimize.
[2023-03-21 22:10:13] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2023-03-21 22:10:13] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 0 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 0 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 0 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 0 ms to minimize.
[2023-03-21 22:10:14] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 0 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 32 places in 467 ms of which 2 ms to minimize.
[2023-03-21 22:10:15] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 0 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 0 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Deduced a trap composed of 29 places in 268 ms of which 1 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 0 ms to minimize.
[2023-03-21 22:10:16] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2023-03-21 22:10:17] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2023-03-21 22:10:17] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2023-03-21 22:10:17] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2023-03-21 22:10:17] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 1 ms to minimize.
[2023-03-21 22:10:18] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 25 ms to minimize.
[2023-03-21 22:10:18] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7523 ms
[2023-03-21 22:10:18] [INFO ] After 8305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-21 22:10:18] [INFO ] After 8725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 843
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 478 place count 943 transition count 683
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 798 place count 783 transition count 683
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
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 1483 place count 441 transition count 340
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1599 place count 383 transition count 378
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 383 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1601 place count 383 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1602 place count 382 transition count 376
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1622 place count 382 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1623 place count 381 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1625 place count 379 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 374
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 1627 place count 378 transition count 374
Applied a total of 1627 rules in 117 ms. Remains 378 /1182 variables (removed 804) and now considering 374/1082 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 378/1182 places, 374/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568143 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568143 steps, saw 364841 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2023-03-21 22:10:21] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:10:21] [INFO ] [Real]Absence check using 179 positive place invariants in 34 ms returned sat
[2023-03-21 22:10:22] [INFO ] After 358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:10:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:10:22] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:22] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:10:22] [INFO ] [Nat]Absence check using 179 positive place invariants in 328 ms returned sat
[2023-03-21 22:10:22] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:22] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:10:22] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-21 22:10:22] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-21 22:10:22] [INFO ] Invariant cache hit.
[2023-03-21 22:10:23] [INFO ] Implicit Places using invariants in 879 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 886 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 373
Applied a total of 2 rules in 7 ms. Remains 376 /377 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 376 cols
[2023-03-21 22:10:23] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:10:24] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-21 22:10:24] [INFO ] Invariant cache hit.
[2023-03-21 22:10:25] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 373/374 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2318 ms. Remains : 376/378 places, 373/374 transitions.
Finished random walk after 5972 steps, including 1 resets, run visited all 1 properties in 38 ms. (steps per millisecond=157 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 320 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 135 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 164 ms :[true, p0, p0]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Entered a terminal (fully accepting) state of product in 67887 steps with 0 reset in 301 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-12 finished in 77964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&X(X(F(p2))))))'
Support contains 5 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 79 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-21 22:10:26] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-21 22:10:27] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-21 22:10:27] [INFO ] Invariant cache hit.
[2023-03-21 22:10:28] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
[2023-03-21 22:10:28] [INFO ] Invariant cache hit.
[2023-03-21 22:10:29] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2366 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s972 0) (EQ s983 0) (EQ s1009 0)), p1:(EQ s298 0), p2:(EQ s1179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 364 ms.
Stack based approach found an accepted trace after 13411 steps with 3 reset with depth 12913 and stack size 12814 in 56 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-14 finished in 3238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1189 transition count 850
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 950 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 480 place count 949 transition count 695
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 788 place count 795 transition count 695
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 793 place count 790 transition count 690
Iterating global reduction 3 with 5 rules applied. Total rules applied 798 place count 790 transition count 690
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 798 place count 790 transition count 685
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 808 place count 785 transition count 685
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1492 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1493 place count 443 transition count 342
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 1495 place count 442 transition count 341
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1611 place count 384 transition count 378
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1613 place count 382 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1615 place count 380 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1615 place count 380 transition count 375
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 1617 place count 379 transition count 375
Applied a total of 1617 rules in 118 ms. Remains 379 /1190 variables (removed 811) and now considering 375/1090 (removed 715) transitions.
// Phase 1: matrix 375 rows 379 cols
[2023-03-21 22:10:30] [INFO ] Computed 179 place invariants in 14 ms
[2023-03-21 22:10:30] [INFO ] Implicit Places using invariants in 258 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 272 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/1190 places, 375/1090 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 377 transition count 374
Applied a total of 2 rules in 8 ms. Remains 377 /378 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 377 cols
[2023-03-21 22:10:30] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:10:30] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-21 22:10:30] [INFO ] Invariant cache hit.
[2023-03-21 22:10:31] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/1190 places, 374/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1514 ms. Remains : 377/1190 places, 374/1090 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s179 1) (EQ s181 1)), p0:(EQ s155 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-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-15 finished in 1652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (p1||G(p0))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-020B-LTLFireability-06
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1189 transition count 851
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 951 transition count 851
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 476 place count 951 transition count 695
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 788 place count 795 transition count 695
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 792 place count 791 transition count 691
Iterating global reduction 2 with 4 rules applied. Total rules applied 796 place count 791 transition count 691
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 796 place count 791 transition count 687
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 804 place count 787 transition count 687
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 2 with 684 rules applied. Total rules applied 1488 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1489 place count 445 transition count 344
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 1491 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1607 place count 386 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1609 place count 384 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1611 place count 382 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 377
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 1613 place count 381 transition count 377
Applied a total of 1613 rules in 135 ms. Remains 381 /1190 variables (removed 809) and now considering 377/1090 (removed 713) transitions.
// Phase 1: matrix 377 rows 381 cols
[2023-03-21 22:10:31] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:10:32] [INFO ] Implicit Places using invariants in 386 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 402 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 380/1190 places, 377/1090 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 379 transition count 376
Applied a total of 2 rules in 9 ms. Remains 379 /380 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 379 cols
[2023-03-21 22:10:32] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:10:32] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-21 22:10:32] [INFO ] Invariant cache hit.
[2023-03-21 22:10:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:10:33] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 379/1190 places, 376/1090 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1370 ms. Remains : 379/1190 places, 376/1090 transitions.
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s21 1) (NEQ s174 1)), p0:(NEQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 456 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-06 finished in 2035 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-21 22:10:33] [INFO ] Flatten gal took : 39 ms
[2023-03-21 22:10:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 22:10:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1190 places, 1090 transitions and 2820 arcs took 8 ms.
Total runtime 197848 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1890/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-020B-LTLFireability-06

BK_STOP 1679436634763

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-020B-LTLFireability-06
ltl formula formula --ltl=/tmp/1890/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1190 places, 1090 transitions and 2820 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.120 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1890/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1890/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1890/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1890/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-020B, 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 r393-oct2-167903716800284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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