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.r389-oct2-167903713400300.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 itstools
Input is ShieldIIPt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400300
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679187112296

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 00:51:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:51:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:51:54] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-19 00:51:54] [INFO ] Transformed 2103 places.
[2023-03-19 00:51:54] [INFO ] Transformed 1953 transitions.
[2023-03-19 00:51:54] [INFO ] Found NUPN structural information;
[2023-03-19 00:51:54] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-030B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1783 transition count 1633
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1783 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 641 place count 1782 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 642 place count 1782 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 1781 transition count 1631
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 1781 transition count 1631
Applied a total of 644 rules in 870 ms. Remains 1781 /2103 variables (removed 322) and now considering 1631/1953 (removed 322) transitions.
// Phase 1: matrix 1631 rows 1781 cols
[2023-03-19 00:51:56] [INFO ] Computed 271 place invariants in 39 ms
[2023-03-19 00:51:57] [INFO ] Implicit Places using invariants in 1407 ms returned []
[2023-03-19 00:51:57] [INFO ] Invariant cache hit.
[2023-03-19 00:51:59] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 3701 ms to find 0 implicit places.
[2023-03-19 00:51:59] [INFO ] Invariant cache hit.
[2023-03-19 00:52:00] [INFO ] Dead Transitions using invariants and state equation in 1094 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1781/2103 places, 1631/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5668 ms. Remains : 1781/2103 places, 1631/1953 transitions.
Support contains 33 out of 1781 places after structural reductions.
[2023-03-19 00:52:01] [INFO ] Flatten gal took : 130 ms
[2023-03-19 00:52:01] [INFO ] Flatten gal took : 59 ms
[2023-03-19 00:52:01] [INFO ] Input system was already deterministic with 1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 27) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2023-03-19 00:52:02] [INFO ] Invariant cache hit.
[2023-03-19 00:52:03] [INFO ] [Real]Absence check using 271 positive place invariants in 181 ms returned sat
[2023-03-19 00:52:03] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 00:52:04] [INFO ] [Nat]Absence check using 271 positive place invariants in 161 ms returned sat
[2023-03-19 00:52:06] [INFO ] After 2074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 00:52:07] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 9 ms to minimize.
[2023-03-19 00:52:08] [INFO ] Deduced a trap composed of 16 places in 542 ms of which 1 ms to minimize.
[2023-03-19 00:52:08] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 1 ms to minimize.
[2023-03-19 00:52:08] [INFO ] Deduced a trap composed of 20 places in 483 ms of which 2 ms to minimize.
[2023-03-19 00:52:09] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 1 ms to minimize.
[2023-03-19 00:52:09] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 0 ms to minimize.
[2023-03-19 00:52:09] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 1 ms to minimize.
[2023-03-19 00:52:10] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 0 ms to minimize.
[2023-03-19 00:52:10] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 1 ms to minimize.
[2023-03-19 00:52:10] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2023-03-19 00:52:11] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 1 ms to minimize.
[2023-03-19 00:52:11] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 1 ms to minimize.
[2023-03-19 00:52:12] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 1 ms to minimize.
[2023-03-19 00:52:12] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 2 ms to minimize.
[2023-03-19 00:52:12] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 1 ms to minimize.
[2023-03-19 00:52:13] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2023-03-19 00:52:13] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 1 ms to minimize.
[2023-03-19 00:52:13] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 1 ms to minimize.
[2023-03-19 00:52:14] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2023-03-19 00:52:14] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 0 ms to minimize.
[2023-03-19 00:52:14] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 1 ms to minimize.
[2023-03-19 00:52:15] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 1 ms to minimize.
[2023-03-19 00:52:15] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 1 ms to minimize.
[2023-03-19 00:52:15] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2023-03-19 00:52:16] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 0 ms to minimize.
[2023-03-19 00:52:16] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 14 ms to minimize.
[2023-03-19 00:52:16] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 1 ms to minimize.
[2023-03-19 00:52:16] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 0 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 0 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 1 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 10971 ms
[2023-03-19 00:52:18] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2023-03-19 00:52:18] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 1 ms to minimize.
[2023-03-19 00:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 666 ms
[2023-03-19 00:52:19] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 1 ms to minimize.
[2023-03-19 00:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-19 00:52:19] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2023-03-19 00:52:19] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2023-03-19 00:52:20] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 0 ms to minimize.
[2023-03-19 00:52:20] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 1 ms to minimize.
[2023-03-19 00:52:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1259 ms
[2023-03-19 00:52:21] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 0 ms to minimize.
[2023-03-19 00:52:21] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2023-03-19 00:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
[2023-03-19 00:52:22] [INFO ] After 17598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1205 ms.
[2023-03-19 00:52:23] [INFO ] After 20393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1347 ms.
Support contains 17 out of 1781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 1781 transition count 1275
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 1425 transition count 1275
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 712 place count 1425 transition count 1042
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1178 place count 1192 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1180 place count 1190 transition count 1040
Iterating global reduction 2 with 2 rules applied. Total rules applied 1182 place count 1190 transition count 1040
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1182 place count 1190 transition count 1038
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1186 place count 1188 transition count 1038
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 6 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2200 place count 681 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2201 place count 681 transition count 530
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2203 place count 680 transition count 529
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 2377 place count 593 transition count 584
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2378 place count 593 transition count 583
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2381 place count 593 transition count 580
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2384 place count 590 transition count 580
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 2415 place count 590 transition count 580
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2416 place count 589 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2418 place count 587 transition count 579
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2418 place count 587 transition count 578
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2420 place count 586 transition count 578
Applied a total of 2420 rules in 426 ms. Remains 586 /1781 variables (removed 1195) and now considering 578/1631 (removed 1053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 586/1781 places, 578/1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 578 rows 586 cols
[2023-03-19 00:52:25] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-19 00:52:26] [INFO ] [Real]Absence check using 269 positive place invariants in 45 ms returned sat
[2023-03-19 00:52:26] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-19 00:52:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 00:52:26] [INFO ] After 42ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:52:26] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:52:26] [INFO ] [Nat]Absence check using 269 positive place invariants in 49 ms returned sat
[2023-03-19 00:52:27] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:27] [INFO ] After 190ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:27] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-19 00:52:27] [INFO ] After 1314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 6 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 578/578 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 586 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 585 transition count 577
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 585 transition count 575
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 583 transition count 575
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 578 transition count 570
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 576 transition count 569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 575 transition count 568
Applied a total of 21 rules in 62 ms. Remains 575 /586 variables (removed 11) and now considering 568/578 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 575/586 places, 568/578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 132130 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132130 steps, saw 84044 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 568 rows 575 cols
[2023-03-19 00:52:31] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-19 00:52:31] [INFO ] [Real]Absence check using 269 positive place invariants in 62 ms returned sat
[2023-03-19 00:52:32] [INFO ] After 285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-19 00:52:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 00:52:32] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-19 00:52:32] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 00:52:32] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-19 00:52:32] [INFO ] [Nat]Absence check using 269 positive place invariants in 60 ms returned sat
[2023-03-19 00:52:32] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:33] [INFO ] After 195ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:33] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-19 00:52:33] [INFO ] After 1423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 6 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 575 /575 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 575/575 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 575 /575 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:52:33] [INFO ] Invariant cache hit.
[2023-03-19 00:52:34] [INFO ] Implicit Places using invariants in 388 ms returned [564]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 568/568 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 573 transition count 567
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 573 transition count 567
Applied a total of 2 rules in 19 ms. Remains 573 /574 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 573 cols
[2023-03-19 00:52:34] [INFO ] Computed 268 place invariants in 4 ms
[2023-03-19 00:52:34] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-19 00:52:34] [INFO ] Invariant cache hit.
[2023-03-19 00:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:52:35] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 573/575 places, 567/568 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1415 ms. Remains : 573/575 places, 567/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 137182 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137182 steps, saw 88026 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 00:52:38] [INFO ] Invariant cache hit.
[2023-03-19 00:52:38] [INFO ] [Real]Absence check using 268 positive place invariants in 41 ms returned sat
[2023-03-19 00:52:38] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:52:38] [INFO ] [Nat]Absence check using 268 positive place invariants in 68 ms returned sat
[2023-03-19 00:52:39] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:52:39] [INFO ] After 178ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:39] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-19 00:52:39] [INFO ] After 1160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 6 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 567/567 transitions.
Applied a total of 0 rules in 16 ms. Remains 573 /573 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 573/573 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 567/567 transitions.
Applied a total of 0 rules in 23 ms. Remains 573 /573 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-19 00:52:40] [INFO ] Invariant cache hit.
[2023-03-19 00:52:40] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-19 00:52:40] [INFO ] Invariant cache hit.
[2023-03-19 00:52:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:52:41] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2023-03-19 00:52:41] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 00:52:41] [INFO ] Invariant cache hit.
[2023-03-19 00:52:41] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1496 ms. Remains : 573/573 places, 567/567 transitions.
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 573 transition count 567
Applied a total of 58 rules in 17 ms. Remains 573 /573 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 567 rows 573 cols
[2023-03-19 00:52:41] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:52:41] [INFO ] [Real]Absence check using 268 positive place invariants in 46 ms returned sat
[2023-03-19 00:52:42] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:52:42] [INFO ] [Nat]Absence check using 268 positive place invariants in 64 ms returned sat
[2023-03-19 00:52:42] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:42] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 00:52:42] [INFO ] After 185ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:52:43] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-19 00:52:43] [INFO ] After 1156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 480 stabilizing places and 480 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(p0)&&G(p1)))))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 202 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-19 00:52:44] [INFO ] Computed 271 place invariants in 22 ms
[2023-03-19 00:52:44] [INFO ] Implicit Places using invariants in 750 ms returned []
[2023-03-19 00:52:44] [INFO ] Invariant cache hit.
[2023-03-19 00:52:46] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
[2023-03-19 00:52:46] [INFO ] Invariant cache hit.
[2023-03-19 00:52:47] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4131 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 686 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(EQ s240 1), p0:(AND (EQ s1214 1) (EQ s1295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-00 finished in 4953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 204 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-19 00:52:48] [INFO ] Computed 271 place invariants in 15 ms
[2023-03-19 00:52:49] [INFO ] Implicit Places using invariants in 839 ms returned []
[2023-03-19 00:52:49] [INFO ] Invariant cache hit.
[2023-03-19 00:52:51] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 2607 ms to find 0 implicit places.
[2023-03-19 00:52:51] [INFO ] Invariant cache hit.
[2023-03-19 00:52:52] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3696 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s233 1), p0:(EQ s966 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 773 ms.
Stack based approach found an accepted trace after 1914 steps with 0 reset with depth 1915 and stack size 1915 in 14 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-01 finished in 4862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))&&X(G(p2))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 174 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-19 00:52:53] [INFO ] Computed 271 place invariants in 11 ms
[2023-03-19 00:52:54] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-19 00:52:54] [INFO ] Invariant cache hit.
[2023-03-19 00:52:56] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 2659 ms to find 0 implicit places.
[2023-03-19 00:52:56] [INFO ] Invariant cache hit.
[2023-03-19 00:52:57] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3932 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (EQ s1512 1) (NEQ s1141 1)), p2:(EQ s1141 0), p1:(EQ s1512 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-04 finished in 4243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 173 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2023-03-19 00:52:57] [INFO ] Invariant cache hit.
[2023-03-19 00:52:58] [INFO ] Implicit Places using invariants in 617 ms returned []
[2023-03-19 00:52:58] [INFO ] Invariant cache hit.
[2023-03-19 00:53:00] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2294 ms to find 0 implicit places.
[2023-03-19 00:53:00] [INFO ] Invariant cache hit.
[2023-03-19 00:53:01] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3560 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1547 0) (EQ s547 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-05 finished in 3703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)&&(p2||F(p3))))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1780 transition count 1270
Reduce places removed 360 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 361 rules applied. Total rules applied 721 place count 1420 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1193 place count 1181 transition count 1031
Iterating global reduction 3 with 5 rules applied. Total rules applied 1198 place count 1181 transition count 1031
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1198 place count 1181 transition count 1026
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1208 place count 1176 transition count 1026
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1022 rules applied. Total rules applied 2230 place count 665 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 665 transition count 514
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2233 place count 664 transition count 513
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2407 place count 577 transition count 568
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2409 place count 575 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2411 place count 573 transition count 566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2411 place count 573 transition count 565
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2413 place count 572 transition count 565
Applied a total of 2413 rules in 303 ms. Remains 572 /1781 variables (removed 1209) and now considering 565/1631 (removed 1066) transitions.
// Phase 1: matrix 565 rows 572 cols
[2023-03-19 00:53:01] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:53:02] [INFO ] Implicit Places using invariants in 358 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 359 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1781 places, 565/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 564
Applied a total of 2 rules in 16 ms. Remains 570 /571 variables (removed 1) and now considering 564/565 (removed 1) transitions.
// Phase 1: matrix 564 rows 570 cols
[2023-03-19 00:53:02] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:53:02] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-19 00:53:02] [INFO ] Invariant cache hit.
[2023-03-19 00:53:03] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1781 places, 564/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1821 ms. Remains : 570/1781 places, 564/1631 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s133 1), p0:(EQ s538 1), p2:(EQ s538 0), p3:(EQ s211 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-06 finished in 2078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1780 transition count 1270
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1420 transition count 1270
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 720 place count 1420 transition count 1036
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1192 place count 1182 transition count 1032
Iterating global reduction 2 with 4 rules applied. Total rules applied 1196 place count 1182 transition count 1032
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1196 place count 1182 transition count 1028
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1204 place count 1178 transition count 1028
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2226 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2227 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2229 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2407 place count 577 transition count 573
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2408 place count 577 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2410 place count 575 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2412 place count 573 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2412 place count 573 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2414 place count 572 transition count 570
Applied a total of 2414 rules in 298 ms. Remains 572 /1781 variables (removed 1209) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 572 cols
[2023-03-19 00:53:03] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-19 00:53:04] [INFO ] Implicit Places using invariants in 359 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1781 places, 570/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 569
Applied a total of 2 rules in 16 ms. Remains 570 /571 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 570 cols
[2023-03-19 00:53:04] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:53:04] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-19 00:53:04] [INFO ] Invariant cache hit.
[2023-03-19 00:53:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:53:05] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1665 ms. Remains : 570/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s209 0) (EQ s74 0)), p0:(OR (EQ s74 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-07 finished in 1881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 362 rules applied. Total rules applied 723 place count 1419 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 724 place count 1418 transition count 1268
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 724 place count 1418 transition count 1036
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 3 with 464 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1195 place count 1179 transition count 1029
Iterating global reduction 3 with 7 rules applied. Total rules applied 1202 place count 1179 transition count 1029
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1202 place count 1179 transition count 1023
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1214 place count 1173 transition count 1023
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2229 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2413 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2415 place count 571 transition count 570
Applied a total of 2415 rules in 273 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-19 00:53:05] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:53:06] [INFO ] Implicit Places using invariants in 351 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 355 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 20 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-19 00:53:06] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:53:06] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-19 00:53:06] [INFO ] Invariant cache hit.
[2023-03-19 00:53:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:07] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1937 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s202 0) (EQ s209 0) (EQ s212 0)), p0:(EQ s550 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21452 reset in 680 ms.
Product exploration explored 100000 steps with 21499 reset in 676 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/569 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 477 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:53:09] [INFO ] Invariant cache hit.
[2023-03-19 00:53:09] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:09] [INFO ] [Nat]Absence check using 268 positive place invariants in 46 ms returned sat
[2023-03-19 00:53:09] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:09] [INFO ] After 24ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:10] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-19 00:53:10] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 569 transition count 568
Applied a total of 2 rules in 20 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 569/569 places, 568/569 transitions.
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 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 363785 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 363785 steps, saw 232811 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:53:13] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:53:13] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:13] [INFO ] [Nat]Absence check using 268 positive place invariants in 87 ms returned sat
[2023-03-19 00:53:13] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:13] [INFO ] After 37ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:13] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 00:53:13] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:53:13] [INFO ] Invariant cache hit.
[2023-03-19 00:53:14] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 00:53:14] [INFO ] Invariant cache hit.
[2023-03-19 00:53:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:14] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-03-19 00:53:14] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 00:53:14] [INFO ] Invariant cache hit.
[2023-03-19 00:53:15] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1565 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 569 transition count 568
Applied a total of 62 rules in 14 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:53:15] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:53:15] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:15] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2023-03-19 00:53:15] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 00:53:15] [INFO ] After 49ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:15] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-19 00:53:16] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0))]
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 20 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-19 00:53:16] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:53:16] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-19 00:53:16] [INFO ] Invariant cache hit.
[2023-03-19 00:53:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:17] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
[2023-03-19 00:53:17] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 00:53:17] [INFO ] Invariant cache hit.
[2023-03-19 00:53:18] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1730 ms. Remains : 569/569 places, 569/569 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/569 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:53:18] [INFO ] Invariant cache hit.
[2023-03-19 00:53:18] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:18] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2023-03-19 00:53:19] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:19] [INFO ] After 27ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:19] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-19 00:53:19] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 569 transition count 568
Applied a total of 2 rules in 38 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 365525 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 365525 steps, saw 233877 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:53:22] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:53:22] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:22] [INFO ] [Nat]Absence check using 268 positive place invariants in 33 ms returned sat
[2023-03-19 00:53:22] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:23] [INFO ] After 53ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:23] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 00:53:23] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:53:23] [INFO ] Invariant cache hit.
[2023-03-19 00:53:23] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-19 00:53:23] [INFO ] Invariant cache hit.
[2023-03-19 00:53:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:53:24] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2023-03-19 00:53:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:53:24] [INFO ] Invariant cache hit.
[2023-03-19 00:53:24] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1437 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 569 transition count 568
Applied a total of 62 rules in 18 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:53:24] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:53:24] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:24] [INFO ] [Nat]Absence check using 268 positive place invariants in 27 ms returned sat
[2023-03-19 00:53:24] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 00:53:25] [INFO ] After 64ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:25] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 00:53:25] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 471 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21537 reset in 685 ms.
Product exploration explored 100000 steps with 21496 reset in 707 ms.
Built C files in :
/tmp/ltsmin877279271580921818
[2023-03-19 00:53:27] [INFO ] Computing symmetric may disable matrix : 569 transitions.
[2023-03-19 00:53:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:53:27] [INFO ] Computing symmetric may enable matrix : 569 transitions.
[2023-03-19 00:53:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:53:27] [INFO ] Computing Do-Not-Accords matrix : 569 transitions.
[2023-03-19 00:53:27] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:53:27] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin877279271580921818
Running compilation step : cd /tmp/ltsmin877279271580921818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1643 ms.
Running link step : cd /tmp/ltsmin877279271580921818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin877279271580921818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5292328990130348255.hoa' '--buchi-type=spotba'
LTSmin run took 4921 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-030B-LTLFireability-08 finished in 28686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&G(p1))||G(!p0)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 722 place count 1419 transition count 1035
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1190 place count 1185 transition count 1035
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1196 place count 1179 transition count 1029
Iterating global reduction 2 with 6 rules applied. Total rules applied 1202 place count 1179 transition count 1029
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1202 place count 1179 transition count 1024
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1212 place count 1174 transition count 1024
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2410 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2412 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2414 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2414 place count 572 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2416 place count 571 transition count 570
Applied a total of 2416 rules in 218 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-19 00:53:34] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-19 00:53:34] [INFO ] Implicit Places using invariants in 388 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 13 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-19 00:53:34] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:53:35] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-19 00:53:35] [INFO ] Invariant cache hit.
[2023-03-19 00:53:35] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1635 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s207 1), p0:(AND (EQ s196 1) (EQ s206 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 594 ms.
Product exploration explored 100000 steps with 2 reset in 700 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 517 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:53:38] [INFO ] Invariant cache hit.
[2023-03-19 00:53:38] [INFO ] [Real]Absence check using 268 positive place invariants in 45 ms returned sat
[2023-03-19 00:53:39] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:53:39] [INFO ] [Nat]Absence check using 268 positive place invariants in 56 ms returned sat
[2023-03-19 00:53:39] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:53:39] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-19 00:53:39] [INFO ] After 901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 93 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Applied a total of 1 rules in 9 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 218350 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218350 steps, saw 137528 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:53:43] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:53:43] [INFO ] [Real]Absence check using 268 positive place invariants in 45 ms returned sat
[2023-03-19 00:53:43] [INFO ] After 299ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-19 00:53:43] [INFO ] After 367ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:53:43] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:53:44] [INFO ] [Nat]Absence check using 268 positive place invariants in 46 ms returned sat
[2023-03-19 00:53:44] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:53:44] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-19 00:53:44] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 25 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 16 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:53:44] [INFO ] Invariant cache hit.
[2023-03-19 00:53:45] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 00:53:45] [INFO ] Invariant cache hit.
[2023-03-19 00:53:46] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2023-03-19 00:53:46] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 00:53:46] [INFO ] Invariant cache hit.
[2023-03-19 00:53:46] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1680 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 569 transition count 568
Applied a total of 59 rules in 15 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:53:46] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:53:46] [INFO ] [Real]Absence check using 268 positive place invariants in 57 ms returned sat
[2023-03-19 00:53:47] [INFO ] After 319ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-19 00:53:47] [INFO ] After 365ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:53:47] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:53:47] [INFO ] [Nat]Absence check using 268 positive place invariants in 50 ms returned sat
[2023-03-19 00:53:47] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:53:47] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-19 00:53:47] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 724 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 272 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 19 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-19 00:53:49] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:53:49] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-19 00:53:49] [INFO ] Invariant cache hit.
[2023-03-19 00:53:50] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2023-03-19 00:53:50] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 00:53:50] [INFO ] Invariant cache hit.
[2023-03-19 00:53:50] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1537 ms. Remains : 569/569 places, 569/569 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 147128 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147128 steps, saw 90770 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-19 00:53:54] [INFO ] Invariant cache hit.
[2023-03-19 00:53:54] [INFO ] [Real]Absence check using 268 positive place invariants in 36 ms returned sat
[2023-03-19 00:53:55] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-19 00:53:55] [INFO ] After 267ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:53:55] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:53:55] [INFO ] [Nat]Absence check using 268 positive place invariants in 96 ms returned sat
[2023-03-19 00:53:56] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 00:53:56] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-19 00:53:56] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Applied a total of 1 rules in 9 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 146137 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146137 steps, saw 91797 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:54:00] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:54:00] [INFO ] [Real]Absence check using 268 positive place invariants in 90 ms returned sat
[2023-03-19 00:54:00] [INFO ] After 203ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-19 00:54:00] [INFO ] After 248ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:54:00] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:54:00] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2023-03-19 00:54:01] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 00:54:01] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-19 00:54:01] [INFO ] After 1076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:54:01] [INFO ] Invariant cache hit.
[2023-03-19 00:54:02] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-19 00:54:02] [INFO ] Invariant cache hit.
[2023-03-19 00:54:02] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2023-03-19 00:54:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:54:02] [INFO ] Invariant cache hit.
[2023-03-19 00:54:03] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1577 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 569 transition count 568
Applied a total of 59 rules in 16 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-19 00:54:03] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:54:03] [INFO ] [Real]Absence check using 268 positive place invariants in 374 ms returned sat
[2023-03-19 00:54:04] [INFO ] After 881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:54:04] [INFO ] [Nat]Absence check using 268 positive place invariants in 33 ms returned sat
[2023-03-19 00:54:04] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 00:54:04] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-19 00:54:05] [INFO ] After 914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 626 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 290 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 245 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1 reset in 615 ms.
Product exploration explored 100000 steps with 0 reset in 695 ms.
Built C files in :
/tmp/ltsmin2033092527743906240
[2023-03-19 00:54:07] [INFO ] Computing symmetric may disable matrix : 569 transitions.
[2023-03-19 00:54:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:54:07] [INFO ] Computing symmetric may enable matrix : 569 transitions.
[2023-03-19 00:54:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:54:07] [INFO ] Computing Do-Not-Accords matrix : 569 transitions.
[2023-03-19 00:54:08] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:54:08] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2033092527743906240
Running compilation step : cd /tmp/ltsmin2033092527743906240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1361 ms.
Running link step : cd /tmp/ltsmin2033092527743906240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin2033092527743906240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1519008120716185502.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-19 00:54:23] [INFO ] Computed 268 place invariants in 14 ms
[2023-03-19 00:54:23] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-19 00:54:23] [INFO ] Invariant cache hit.
[2023-03-19 00:54:24] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1443 ms to find 0 implicit places.
[2023-03-19 00:54:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:54:24] [INFO ] Invariant cache hit.
[2023-03-19 00:54:24] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1844 ms. Remains : 569/569 places, 569/569 transitions.
Built C files in :
/tmp/ltsmin12066058126597334497
[2023-03-19 00:54:24] [INFO ] Computing symmetric may disable matrix : 569 transitions.
[2023-03-19 00:54:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:54:24] [INFO ] Computing symmetric may enable matrix : 569 transitions.
[2023-03-19 00:54:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:54:24] [INFO ] Computing Do-Not-Accords matrix : 569 transitions.
[2023-03-19 00:54:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:54:24] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12066058126597334497
Running compilation step : cd /tmp/ltsmin12066058126597334497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1405 ms.
Running link step : cd /tmp/ltsmin12066058126597334497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin12066058126597334497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6833502045289466216.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 00:54:40] [INFO ] Flatten gal took : 28 ms
[2023-03-19 00:54:40] [INFO ] Flatten gal took : 26 ms
[2023-03-19 00:54:40] [INFO ] Time to serialize gal into /tmp/LTL17979333659761693322.gal : 5 ms
[2023-03-19 00:54:40] [INFO ] Time to serialize properties into /tmp/LTL13301368559872537262.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17979333659761693322.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2088648237673875832.hoa' '-atoms' '/tmp/LTL13301368559872537262.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13301368559872537262.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2088648237673875832.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.12205e+36 deadlock states
3 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
609 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.18625,190292,1,0,148,1.04941e+06,34,143,15737,1.22999e+06,264
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-030B-LTLFireability-09 finished in 73717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 124 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-19 00:54:47] [INFO ] Computed 271 place invariants in 11 ms
[2023-03-19 00:54:48] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-19 00:54:48] [INFO ] Invariant cache hit.
[2023-03-19 00:54:50] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2858 ms to find 0 implicit places.
[2023-03-19 00:54:50] [INFO ] Invariant cache hit.
[2023-03-19 00:54:51] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3954 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s1585 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-10 finished in 4113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1780 transition count 1268
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1418 transition count 1268
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 724 place count 1418 transition count 1035
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1190 place count 1185 transition count 1035
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1195 place count 1180 transition count 1030
Iterating global reduction 2 with 5 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1025
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1210 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2413 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2415 place count 571 transition count 570
Applied a total of 2415 rules in 272 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-19 00:54:52] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:54:52] [INFO ] Implicit Places using invariants in 349 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 14 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-19 00:54:52] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:54:53] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-19 00:54:53] [INFO ] Invariant cache hit.
[2023-03-19 00:54:53] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1795 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s115 1)), p1:(NEQ s286 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25299 steps with 0 reset in 163 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-11 finished in 2066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 182 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-19 00:54:54] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-19 00:54:55] [INFO ] Implicit Places using invariants in 869 ms returned []
[2023-03-19 00:54:55] [INFO ] Invariant cache hit.
[2023-03-19 00:54:56] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2644 ms to find 0 implicit places.
[2023-03-19 00:54:56] [INFO ] Invariant cache hit.
[2023-03-19 00:54:57] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3723 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1666 1) (EQ s1711 1)), p1:(AND (OR (NEQ s1666 1) (NEQ s1711 1)) (EQ s1361 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 169 reset in 446 ms.
Product exploration explored 100000 steps with 179 reset in 499 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4571 steps, including 1 resets, run visited all 3 properties in 61 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 563 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Applied a total of 0 rules in 120 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2023-03-19 00:55:00] [INFO ] Invariant cache hit.
[2023-03-19 00:55:01] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-19 00:55:01] [INFO ] Invariant cache hit.
[2023-03-19 00:55:03] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
[2023-03-19 00:55:03] [INFO ] Invariant cache hit.
[2023-03-19 00:55:04] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3797 ms. Remains : 1772/1772 places, 1622/1622 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2271 steps, including 0 resets, run visited all 3 properties in 43 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 343 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 175 reset in 494 ms.
Product exploration explored 100000 steps with 177 reset in 471 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1772 transition count 1622
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 358 place count 1772 transition count 1713
Deduced a syphon composed of 479 places in 2 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 479 place count 1772 transition count 1713
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1077 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1077 place count 1772 transition count 1713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1078 place count 1772 transition count 1712
Renaming transitions due to excessive name length > 1024 char.
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 1318 place count 1532 transition count 1472
Deduced a syphon composed of 837 places in 2 ms
Iterating global reduction 2 with 240 rules applied. Total rules applied 1558 place count 1532 transition count 1472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 838 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1559 place count 1532 transition count 1472
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1561 place count 1530 transition count 1470
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1563 place count 1530 transition count 1470
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -523
Deduced a syphon composed of 937 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1664 place count 1530 transition count 1993
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1765 place count 1429 transition count 1791
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1866 place count 1429 transition count 1791
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 853 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1883 place count 1429 transition count 1888
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1900 place count 1412 transition count 1854
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1917 place count 1412 transition count 1854
Deduced a syphon composed of 836 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1926 place count 1412 transition count 1845
Deduced a syphon composed of 836 places in 2 ms
Applied a total of 1926 rules in 1074 ms. Remains 1412 /1772 variables (removed 360) and now considering 1845/1622 (removed -223) transitions.
[2023-03-19 00:55:08] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1845 rows 1412 cols
[2023-03-19 00:55:08] [INFO ] Computed 271 place invariants in 21 ms
[2023-03-19 00:55:09] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1412/1772 places, 1845/1622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2080 ms. Remains : 1412/1772 places, 1845/1622 transitions.
Built C files in :
/tmp/ltsmin3034215662723876467
[2023-03-19 00:55:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3034215662723876467
Running compilation step : cd /tmp/ltsmin3034215662723876467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2833 ms.
Running link step : cd /tmp/ltsmin3034215662723876467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3034215662723876467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16682266312887982610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Applied a total of 0 rules in 107 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-19 00:55:24] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-19 00:55:25] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-19 00:55:25] [INFO ] Invariant cache hit.
[2023-03-19 00:55:27] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2708 ms to find 0 implicit places.
[2023-03-19 00:55:27] [INFO ] Invariant cache hit.
[2023-03-19 00:55:28] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4007 ms. Remains : 1772/1772 places, 1622/1622 transitions.
Built C files in :
/tmp/ltsmin9254020278441770133
[2023-03-19 00:55:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9254020278441770133
Running compilation step : cd /tmp/ltsmin9254020278441770133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2889 ms.
Running link step : cd /tmp/ltsmin9254020278441770133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin9254020278441770133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4383581909901437045.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 00:55:43] [INFO ] Flatten gal took : 52 ms
[2023-03-19 00:55:43] [INFO ] Flatten gal took : 51 ms
[2023-03-19 00:55:43] [INFO ] Time to serialize gal into /tmp/LTL15653383993897400963.gal : 7 ms
[2023-03-19 00:55:43] [INFO ] Time to serialize properties into /tmp/LTL17144333985437615440.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15653383993897400963.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10614215227626034233.hoa' '-atoms' '/tmp/LTL17144333985437615440.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17144333985437615440.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10614215227626034233.hoa
Detected timeout of ITS tools.
[2023-03-19 00:55:58] [INFO ] Flatten gal took : 46 ms
[2023-03-19 00:55:58] [INFO ] Flatten gal took : 46 ms
[2023-03-19 00:55:58] [INFO ] Time to serialize gal into /tmp/LTL11572757532773201154.gal : 7 ms
[2023-03-19 00:55:58] [INFO ] Time to serialize properties into /tmp/LTL3258661595854106910.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11572757532773201154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3258661595854106910.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("((p1973==1)&&(p2027==1))")))||(G("(((p1973!=1)||(p2027!=1))&&(p1611==0))"))))
Formula 0 simplified : XG!"((p1973==1)&&(p2027==1))" & F!"(((p1973!=1)||(p2027!=1))&&(p1611==0))"
Detected timeout of ITS tools.
[2023-03-19 00:56:14] [INFO ] Flatten gal took : 83 ms
[2023-03-19 00:56:14] [INFO ] Applying decomposition
[2023-03-19 00:56:14] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9854738498860254568.txt' '-o' '/tmp/graph9854738498860254568.bin' '-w' '/tmp/graph9854738498860254568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9854738498860254568.bin' '-l' '-1' '-v' '-w' '/tmp/graph9854738498860254568.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:56:14] [INFO ] Decomposing Gal with order
[2023-03-19 00:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:56:14] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 00:56:14] [INFO ] Flatten gal took : 119 ms
[2023-03-19 00:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-19 00:56:14] [INFO ] Time to serialize gal into /tmp/LTL17167652235028832856.gal : 17 ms
[2023-03-19 00:56:14] [INFO ] Time to serialize properties into /tmp/LTL1439192823171459102.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17167652235028832856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1439192823171459102.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i28.u619.p1973==1)&&(i28.u635.p2027==1))")))||(G("(((i28.u619.p1973!=1)||(i28.u635.p2027!=1))&&(i22.i1.i3.u506.p1611==0))")...158
Formula 0 simplified : XG!"((i28.u619.p1973==1)&&(i28.u635.p2027==1))" & F!"(((i28.u619.p1973!=1)||(i28.u635.p2027!=1))&&(i22.i1.i3.u506.p1611==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7316361165549102919
[2023-03-19 00:56:29] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7316361165549102919
Running compilation step : cd /tmp/ltsmin7316361165549102919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2783 ms.
Running link step : cd /tmp/ltsmin7316361165549102919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7316361165549102919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-12 finished in 110842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1193 place count 1181 transition count 1031
Iterating global reduction 2 with 5 rules applied. Total rules applied 1198 place count 1181 transition count 1031
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1198 place count 1181 transition count 1026
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1208 place count 1176 transition count 1026
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 0 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2230 place count 665 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2231 place count 665 transition count 514
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2233 place count 664 transition count 513
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2409 place count 576 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2411 place count 574 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2413 place count 572 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 568
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2415 place count 571 transition count 568
Applied a total of 2415 rules in 273 ms. Remains 571 /1781 variables (removed 1210) and now considering 568/1631 (removed 1063) transitions.
// Phase 1: matrix 568 rows 571 cols
[2023-03-19 00:56:45] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-19 00:56:45] [INFO ] Implicit Places using invariants in 364 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 367 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 568/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 567
Applied a total of 2 rules in 19 ms. Remains 569 /570 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 569 cols
[2023-03-19 00:56:45] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:56:45] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-19 00:56:45] [INFO ] Invariant cache hit.
[2023-03-19 00:56:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:56:46] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 567/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1631 ms. Remains : 569/1781 places, 567/1631 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s400 1), p0:(EQ s568 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 676 ms.
Product exploration explored 100000 steps with 50000 reset in 746 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 425 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 1079 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-19 00:56:49] [INFO ] Invariant cache hit.
[2023-03-19 00:56:50] [INFO ] [Real]Absence check using 268 positive place invariants in 606 ms returned sat
[2023-03-19 00:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:56:51] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2023-03-19 00:56:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:56:51] [INFO ] [Nat]Absence check using 268 positive place invariants in 103 ms returned sat
[2023-03-19 00:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:56:52] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2023-03-19 00:56:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:56:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 22 ms returned sat
[2023-03-19 00:56:52] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-19 00:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-19 00:56:52] [INFO ] Computed and/alt/rep : 566/868/566 causal constraints (skipped 0 transitions) in 66 ms.
[2023-03-19 00:57:06] [INFO ] Added : 518 causal constraints over 105 iterations in 13840 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 9 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-19 00:57:06] [INFO ] Invariant cache hit.
[2023-03-19 00:57:06] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-19 00:57:06] [INFO ] Invariant cache hit.
[2023-03-19 00:57:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:57:07] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2023-03-19 00:57:07] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:57:07] [INFO ] Invariant cache hit.
[2023-03-19 00:57:07] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1531 ms. Remains : 569/569 places, 567/567 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 6531 steps, including 1 resets, run visited all 2 properties in 71 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 496 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-19 00:57:08] [INFO ] Invariant cache hit.
[2023-03-19 00:57:09] [INFO ] [Real]Absence check using 268 positive place invariants in 100 ms returned sat
[2023-03-19 00:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:57:10] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2023-03-19 00:57:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:57:10] [INFO ] [Nat]Absence check using 268 positive place invariants in 105 ms returned sat
[2023-03-19 00:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:57:11] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2023-03-19 00:57:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:57:11] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2023-03-19 00:57:11] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-19 00:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-19 00:57:11] [INFO ] Computed and/alt/rep : 566/868/566 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-19 00:57:24] [INFO ] Added : 518 causal constraints over 105 iterations in 12707 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 681 ms.
Product exploration explored 100000 steps with 50000 reset in 718 ms.
Built C files in :
/tmp/ltsmin9056438225464625204
[2023-03-19 00:57:25] [INFO ] Computing symmetric may disable matrix : 567 transitions.
[2023-03-19 00:57:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:57:25] [INFO ] Computing symmetric may enable matrix : 567 transitions.
[2023-03-19 00:57:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:57:25] [INFO ] Computing Do-Not-Accords matrix : 567 transitions.
[2023-03-19 00:57:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:57:25] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9056438225464625204
Running compilation step : cd /tmp/ltsmin9056438225464625204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1334 ms.
Running link step : cd /tmp/ltsmin9056438225464625204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9056438225464625204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1563911932323105848.hoa' '--buchi-type=spotba'
LTSmin run took 4874 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-030B-LTLFireability-14 finished in 47078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 161 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-19 00:57:32] [INFO ] Computed 271 place invariants in 9 ms
[2023-03-19 00:57:32] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-19 00:57:32] [INFO ] Invariant cache hit.
[2023-03-19 00:57:34] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
[2023-03-19 00:57:34] [INFO ] Invariant cache hit.
[2023-03-19 00:57:35] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3529 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s751 1), p0:(NEQ s867 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 447 ms.
Stack based approach found an accepted trace after 1437 steps with 0 reset with depth 1438 and stack size 1438 in 8 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-15 finished in 4145 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)))'
Found a Shortening insensitive property : ShieldIIPt-PT-030B-LTLFireability-12
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1194 place count 1180 transition count 1030
Iterating global reduction 2 with 6 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1024
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1212 place count 1174 transition count 1024
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2407 place count 577 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2409 place count 575 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2411 place count 573 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2411 place count 573 transition count 568
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2413 place count 572 transition count 568
Applied a total of 2413 rules in 305 ms. Remains 572 /1781 variables (removed 1209) and now considering 568/1631 (removed 1063) transitions.
// Phase 1: matrix 568 rows 572 cols
[2023-03-19 00:57:36] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-19 00:57:37] [INFO ] Implicit Places using invariants in 467 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 468 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 571/1781 places, 568/1631 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 567
Applied a total of 2 rules in 31 ms. Remains 570 /571 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 570 cols
[2023-03-19 00:57:37] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:57:37] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-19 00:57:37] [INFO ] Invariant cache hit.
[2023-03-19 00:57:38] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 570/1781 places, 567/1631 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1910 ms. Remains : 570/1781 places, 567/1631 transitions.
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s537 1) (EQ s556 1)), p1:(AND (OR (NEQ s537 1) (NEQ s556 1)) (EQ s438 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2229 steps with 100 reset in 12 ms.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-12 finished in 2264 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 00:57:38] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12838125638734094280
[2023-03-19 00:57:38] [INFO ] Too many transitions (1631) to apply POR reductions. Disabling POR matrices.
[2023-03-19 00:57:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12838125638734094280
Running compilation step : cd /tmp/ltsmin12838125638734094280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 00:57:38] [INFO ] Applying decomposition
[2023-03-19 00:57:38] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17443361256644484637.txt' '-o' '/tmp/graph17443361256644484637.bin' '-w' '/tmp/graph17443361256644484637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17443361256644484637.bin' '-l' '-1' '-v' '-w' '/tmp/graph17443361256644484637.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:57:38] [INFO ] Decomposing Gal with order
[2023-03-19 00:57:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:57:38] [INFO ] Removed a total of 295 redundant transitions.
[2023-03-19 00:57:38] [INFO ] Flatten gal took : 89 ms
[2023-03-19 00:57:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-19 00:57:38] [INFO ] Time to serialize gal into /tmp/LTLFireability12111552532666425055.gal : 21 ms
[2023-03-19 00:57:38] [INFO ] Time to serialize properties into /tmp/LTLFireability5920031017093463464.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12111552532666425055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5920031017093463464.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i28.i3.u633.p1973==1)&&(i28.i7.u649.p2027==1))")))||(G("(((i28.i3.u633.p1973!=1)||(i28.i7.u649.p2027!=1))&&(i22.i6.u517.p16...167
Formula 0 simplified : XG!"((i28.i3.u633.p1973==1)&&(i28.i7.u649.p2027==1))" & F!"(((i28.i3.u633.p1973!=1)||(i28.i7.u649.p2027!=1))&&(i22.i6.u517.p1611==0)...157
Compilation finished in 3243 ms.
Running link step : cd /tmp/ltsmin12838125638734094280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin12838125638734094280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: LTL layer: formula: (X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))
pins2lts-mc-linux64( 7/ 8), 0.025: "(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.032: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.656: DFS-FIFO for weak LTL, using special progress label 1634
pins2lts-mc-linux64( 0/ 8), 0.656: There are 1635 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.656: State length is 1782, there are 1636 groups
pins2lts-mc-linux64( 0/ 8), 0.656: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.656: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.656: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.656: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.749: ~1 levels ~960 states ~5496 transitions
pins2lts-mc-linux64( 5/ 8), 0.813: ~1 levels ~1920 states ~12368 transitions
pins2lts-mc-linux64( 5/ 8), 1.025: ~1 levels ~3840 states ~25152 transitions
pins2lts-mc-linux64( 5/ 8), 1.558: ~1 levels ~7680 states ~54784 transitions
pins2lts-mc-linux64( 5/ 8), 2.566: ~1 levels ~15360 states ~117312 transitions
pins2lts-mc-linux64( 5/ 8), 4.482: ~1 levels ~30720 states ~250280 transitions
pins2lts-mc-linux64( 0/ 8), 8.129: ~1 levels ~61440 states ~495384 transitions
pins2lts-mc-linux64( 0/ 8), 15.399: ~1 levels ~122880 states ~1073880 transitions
pins2lts-mc-linux64( 0/ 8), 29.355: ~1 levels ~245760 states ~2269608 transitions
pins2lts-mc-linux64( 0/ 8), 57.109: ~1 levels ~491520 states ~4808936 transitions
pins2lts-mc-linux64( 0/ 8), 113.230: ~1 levels ~983040 states ~10150304 transitions
pins2lts-mc-linux64( 0/ 8), 228.430: ~1 levels ~1966080 states ~21465360 transitions
pins2lts-mc-linux64( 0/ 8), 459.361: ~1 levels ~3932160 states ~44650856 transitions
pins2lts-mc-linux64( 2/ 8), 765.791: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 765.909:
pins2lts-mc-linux64( 0/ 8), 765.909: mean standard work distribution: 1.0% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 765.909:
pins2lts-mc-linux64( 0/ 8), 765.909: Explored 6339229 states 79094790 transitions, fanout: 12.477
pins2lts-mc-linux64( 0/ 8), 765.909: Total exploration time 765.240 sec (765.120 sec minimum, 765.165 sec on average)
pins2lts-mc-linux64( 0/ 8), 765.909: States per second: 8284, Transitions per second: 103359
pins2lts-mc-linux64( 0/ 8), 765.909:
pins2lts-mc-linux64( 0/ 8), 765.909: Progress states detected: 15764573
pins2lts-mc-linux64( 0/ 8), 765.909: Redundant explorations: -59.7883
pins2lts-mc-linux64( 0/ 8), 765.909:
pins2lts-mc-linux64( 0/ 8), 765.909: Queue width: 8B, total height: 14699781, memory: 112.15MB
pins2lts-mc-linux64( 0/ 8), 765.909: Tree memory: 376.3MB, 25.0 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 765.909: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 765.909: Stored 2526 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 765.909: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 765.909: Est. total memory use: 488.4MB (~1136.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12838125638734094280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12838125638734094280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 01:19:33] [INFO ] Applying decomposition
[2023-03-19 01:19:33] [INFO ] Flatten gal took : 37 ms
[2023-03-19 01:19:33] [INFO ] Decomposing Gal with order
[2023-03-19 01:19:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:19:33] [INFO ] Removed a total of 88 redundant transitions.
[2023-03-19 01:19:33] [INFO ] Flatten gal took : 60 ms
[2023-03-19 01:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-19 01:19:33] [INFO ] Time to serialize gal into /tmp/LTLFireability10415249285681052742.gal : 18 ms
[2023-03-19 01:19:33] [INFO ] Time to serialize properties into /tmp/LTLFireability10034056556041276815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10415249285681052742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10034056556041276815.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i0.i1.i0.i0.i0.i0.i0.i0.u514.p1973==1)&&(i0.i1.u523.p2027==1))")))||(G("(((i0.i1.i0.i0.i0.i0.i0.i0.u514.p1973!=1)||(i0.i1.u...216
Formula 0 simplified : XG!"((i0.i1.i0.i0.i0.i0.i0.i0.u514.p1973==1)&&(i0.i1.u523.p2027==1))" & F!"(((i0.i1.i0.i0.i0.i0.i0.i0.u514.p1973!=1)||(i0.i1.u523.p2...206
Detected timeout of ITS tools.
[2023-03-19 01:41:32] [INFO ] Flatten gal took : 574 ms
[2023-03-19 01:41:36] [INFO ] Input system was already deterministic with 1631 transitions.
[2023-03-19 01:41:36] [INFO ] Transformed 1781 places.
[2023-03-19 01:41:36] [INFO ] Transformed 1631 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 01:41:37] [INFO ] Time to serialize gal into /tmp/LTLFireability14036020262278757374.gal : 60 ms
[2023-03-19 01:41:37] [INFO ] Time to serialize properties into /tmp/LTLFireability606665165149774431.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14036020262278757374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability606665165149774431.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(F("((p1973==1)&&(p2027==1))")))||(G("(((p1973!=1)||(p2027!=1))&&(p1611==0))"))))
Formula 0 simplified : XG!"((p1973==1)&&(p2027==1))" & F!"(((p1973!=1)||(p2027!=1))&&(p1611==0))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 4331656 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16223056 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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

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