Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716985115286

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 12:18:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:18:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:18:37] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-05-29 12:18:37] [INFO ] Transformed 1563 places.
[2024-05-29 12:18:37] [INFO ] Transformed 1423 transitions.
[2024-05-29 12:18:37] [INFO ] Found NUPN structural information;
[2024-05-29 12:18:37] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 50 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 1351 transition count 1211
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 1351 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1350 transition count 1210
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1350 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1349 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1349 transition count 1209
Applied a total of 428 rules in 485 ms. Remains 1349 /1563 variables (removed 214) and now considering 1209/1423 (removed 214) transitions.
// Phase 1: matrix 1209 rows 1349 cols
[2024-05-29 12:18:38] [INFO ] Computed 221 invariants in 33 ms
[2024-05-29 12:18:38] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-29 12:18:38] [INFO ] Invariant cache hit.
[2024-05-29 12:18:39] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2024-05-29 12:18:39] [INFO ] Invariant cache hit.
[2024-05-29 12:18:40] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1349/1563 places, 1209/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3001 ms. Remains : 1349/1563 places, 1209/1423 transitions.
Support contains 50 out of 1349 places after structural reductions.
[2024-05-29 12:18:40] [INFO ] Flatten gal took : 104 ms
[2024-05-29 12:18:41] [INFO ] Flatten gal took : 65 ms
[2024-05-29 12:18:41] [INFO ] Input system was already deterministic with 1209 transitions.
Support contains 44 out of 1349 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 32) seen :13
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-29 12:18:41] [INFO ] Invariant cache hit.
[2024-05-29 12:18:42] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-29 12:18:43] [INFO ] [Nat]Absence check using 221 positive place invariants in 64 ms returned sat
[2024-05-29 12:18:45] [INFO ] After 1451ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2024-05-29 12:18:45] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 7 ms to minimize.
[2024-05-29 12:18:45] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2024-05-29 12:18:45] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2024-05-29 12:18:46] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 2 ms to minimize.
[2024-05-29 12:18:46] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2024-05-29 12:18:46] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2024-05-29 12:18:46] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2024-05-29 12:18:46] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2024-05-29 12:18:47] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 1 ms to minimize.
[2024-05-29 12:18:47] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2024-05-29 12:18:47] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2024-05-29 12:18:47] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2024-05-29 12:18:47] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2024-05-29 12:18:48] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2024-05-29 12:18:48] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2024-05-29 12:18:48] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2024-05-29 12:18:48] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2024-05-29 12:18:48] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2024-05-29 12:18:48] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2024-05-29 12:18:49] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-05-29 12:18:49] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2024-05-29 12:18:49] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-05-29 12:18:49] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2024-05-29 12:18:49] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-29 12:18:49] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-29 12:18:49] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2024-05-29 12:18:50] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5666 ms
[2024-05-29 12:18:51] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 4 ms to minimize.
[2024-05-29 12:18:51] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2024-05-29 12:18:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2024-05-29 12:18:51] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-29 12:18:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-05-29 12:18:52] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2024-05-29 12:18:52] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2024-05-29 12:18:52] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 1 ms to minimize.
[2024-05-29 12:18:52] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 0 ms to minimize.
[2024-05-29 12:18:53] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 1 ms to minimize.
[2024-05-29 12:18:53] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2024-05-29 12:18:53] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 0 ms to minimize.
[2024-05-29 12:18:53] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 0 ms to minimize.
[2024-05-29 12:18:53] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 1 ms to minimize.
[2024-05-29 12:18:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2103 ms
[2024-05-29 12:18:54] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 1 ms to minimize.
[2024-05-29 12:18:54] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 1 ms to minimize.
[2024-05-29 12:18:54] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 1 ms to minimize.
[2024-05-29 12:18:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 815 ms
[2024-05-29 12:18:55] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2024-05-29 12:18:55] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2024-05-29 12:18:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 466 ms
[2024-05-29 12:18:55] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-29 12:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-05-29 12:18:55] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-05-29 12:18:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-29 12:18:56] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2024-05-29 12:18:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-05-29 12:18:56] [INFO ] After 12808ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 975 ms.
[2024-05-29 12:18:57] [INFO ] After 14942ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 594 ms.
Support contains 27 out of 1349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Drop transitions removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 268 place count 1349 transition count 941
Reduce places removed 268 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 271 rules applied. Total rules applied 539 place count 1081 transition count 938
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 542 place count 1078 transition count 938
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 542 place count 1078 transition count 788
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 842 place count 928 transition count 788
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 843 place count 927 transition count 787
Iterating global reduction 3 with 1 rules applied. Total rules applied 844 place count 927 transition count 787
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 844 place count 927 transition count 786
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 846 place count 926 transition count 786
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 3 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1522 place count 588 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1523 place count 588 transition count 447
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1525 place count 587 transition count 446
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1635 place count 532 transition count 446
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1636 place count 532 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1637 place count 531 transition count 445
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1694 place count 531 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1695 place count 530 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1696 place count 529 transition count 444
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1696 place count 529 transition count 442
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1700 place count 527 transition count 442
Applied a total of 1700 rules in 402 ms. Remains 527 /1349 variables (removed 822) and now considering 442/1209 (removed 767) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 527/1349 places, 442/1209 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 442 rows 527 cols
[2024-05-29 12:18:59] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 12:18:59] [INFO ] [Real]Absence check using 220 positive place invariants in 29 ms returned sat
[2024-05-29 12:18:59] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 12:18:59] [INFO ] [Nat]Absence check using 220 positive place invariants in 31 ms returned sat
[2024-05-29 12:19:00] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 12:19:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:00] [INFO ] After 148ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-29 12:19:00] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:19:00] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 21 ms to minimize.
[2024-05-29 12:19:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2024-05-29 12:19:01] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:19:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 12:19:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2024-05-29 12:19:01] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 151 ms.
[2024-05-29 12:19:01] [INFO ] After 1518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 101 ms.
Support contains 13 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 442/442 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 527 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 526 transition count 441
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 526 transition count 438
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 523 transition count 438
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 521 transition count 436
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 521 transition count 436
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 521 transition count 434
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 16 place count 519 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 517 transition count 432
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 514 transition count 431
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 514 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 513 transition count 430
Applied a total of 28 rules in 307 ms. Remains 513 /527 variables (removed 14) and now considering 430/442 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 513/527 places, 430/442 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) 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 8) seen :0
Interrupted probabilistic random walk after 152087 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152087 steps, saw 117848 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 430 rows 513 cols
[2024-05-29 12:19:05] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 12:19:05] [INFO ] [Real]Absence check using 220 positive place invariants in 36 ms returned sat
[2024-05-29 12:19:05] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 12:19:05] [INFO ] [Nat]Absence check using 220 positive place invariants in 35 ms returned sat
[2024-05-29 12:19:06] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 12:19:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:06] [INFO ] After 173ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-29 12:19:06] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-29 12:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-29 12:19:06] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-29 12:19:06] [INFO ] After 1189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 430/430 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 513/513 places, 430/430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 430/430 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-05-29 12:19:06] [INFO ] Invariant cache hit.
[2024-05-29 12:19:07] [INFO ] Implicit Places using invariants in 305 ms returned [495, 499]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 307 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/513 places, 430/430 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 509 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 509 transition count 428
Applied a total of 4 rules in 18 ms. Remains 509 /511 variables (removed 2) and now considering 428/430 (removed 2) transitions.
// Phase 1: matrix 428 rows 509 cols
[2024-05-29 12:19:07] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 12:19:07] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-29 12:19:07] [INFO ] Invariant cache hit.
[2024-05-29 12:19:08] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 509/513 places, 428/430 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1160 ms. Remains : 509/513 places, 428/430 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 161512 steps, run timeout after 3006 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161512 steps, saw 124229 distinct states, run finished after 3012 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-29 12:19:11] [INFO ] Invariant cache hit.
[2024-05-29 12:19:11] [INFO ] [Real]Absence check using 218 positive place invariants in 34 ms returned sat
[2024-05-29 12:19:11] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 12:19:12] [INFO ] [Nat]Absence check using 218 positive place invariants in 35 ms returned sat
[2024-05-29 12:19:12] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 12:19:12] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2024-05-29 12:19:12] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:19:12] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:19:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2024-05-29 12:19:12] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-29 12:19:13] [INFO ] After 1191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 13 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 428/428 transitions.
Applied a total of 0 rules in 11 ms. Remains 509 /509 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 509/509 places, 428/428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 428/428 transitions.
Applied a total of 0 rules in 10 ms. Remains 509 /509 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-05-29 12:19:13] [INFO ] Invariant cache hit.
[2024-05-29 12:19:13] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-29 12:19:13] [INFO ] Invariant cache hit.
[2024-05-29 12:19:14] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-29 12:19:14] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-29 12:19:14] [INFO ] Invariant cache hit.
[2024-05-29 12:19:14] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1119 ms. Remains : 509/509 places, 428/428 transitions.
Partial Free-agglomeration rule applied 107 times.
Drop transitions removed 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 107 place count 509 transition count 428
Applied a total of 107 rules in 22 ms. Remains 509 /509 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 428 rows 509 cols
[2024-05-29 12:19:14] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 12:19:14] [INFO ] [Real]Absence check using 218 positive place invariants in 36 ms returned sat
[2024-05-29 12:19:14] [INFO ] After 222ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2024-05-29 12:19:14] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 12:19:14] [INFO ] After 43ms SMT Verify possible using 99 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 12:19:14] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 12:19:14] [INFO ] [Nat]Absence check using 218 positive place invariants in 32 ms returned sat
[2024-05-29 12:19:15] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 12:19:15] [INFO ] After 263ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-29 12:19:15] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 12:19:15] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2024-05-29 12:19:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2024-05-29 12:19:15] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2024-05-29 12:19:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-29 12:19:16] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 12:19:16] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-29 12:19:16] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 12:19:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 335 ms
[2024-05-29 12:19:16] [INFO ] After 1172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 186 ms.
[2024-05-29 12:19:16] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA ShieldPPPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 319 stabilizing places and 319 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1348 transition count 931
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 1071 transition count 931
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 554 place count 1071 transition count 776
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 864 place count 916 transition count 776
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 871 place count 909 transition count 769
Iterating global reduction 2 with 7 rules applied. Total rules applied 878 place count 909 transition count 769
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 878 place count 909 transition count 762
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 892 place count 902 transition count 762
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1566 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1567 place count 565 transition count 424
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 1569 place count 564 transition count 423
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1687 place count 505 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1689 place count 503 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1690 place count 502 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1690 place count 502 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1694 place count 500 transition count 419
Applied a total of 1694 rules in 171 ms. Remains 500 /1349 variables (removed 849) and now considering 419/1209 (removed 790) transitions.
// Phase 1: matrix 419 rows 500 cols
[2024-05-29 12:19:17] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 12:19:17] [INFO ] Implicit Places using invariants in 278 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 279 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/1349 places, 419/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 496 transition count 417
Applied a total of 4 rules in 16 ms. Remains 496 /498 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 496 cols
[2024-05-29 12:19:17] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 12:19:17] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 12:19:17] [INFO ] Invariant cache hit.
[2024-05-29 12:19:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:18] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/1349 places, 417/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1221 ms. Remains : 496/1349 places, 417/1209 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s276 0), p1:(EQ s362 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 544 ms.
Stack based approach found an accepted trace after 4135 steps with 5 reset with depth 4088 and stack size 3844 in 27 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-00 finished in 2138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 123 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 12:19:19] [INFO ] Computed 221 invariants in 8 ms
[2024-05-29 12:19:19] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-29 12:19:19] [INFO ] Invariant cache hit.
[2024-05-29 12:19:20] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2024-05-29 12:19:20] [INFO ] Invariant cache hit.
[2024-05-29 12:19:21] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2448 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s457 0)], 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 59586 steps with 0 reset in 296 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-01 finished in 2848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1348 transition count 930
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1070 transition count 930
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 556 place count 1070 transition count 775
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 866 place count 915 transition count 775
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 873 place count 908 transition count 768
Iterating global reduction 2 with 7 rules applied. Total rules applied 880 place count 908 transition count 768
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 880 place count 908 transition count 761
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1570 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1571 place count 563 transition count 422
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 1573 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1691 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1693 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1694 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1694 place count 500 transition count 417
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1698 place count 498 transition count 417
Applied a total of 1698 rules in 210 ms. Remains 498 /1349 variables (removed 851) and now considering 417/1209 (removed 792) transitions.
// Phase 1: matrix 417 rows 498 cols
[2024-05-29 12:19:22] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 12:19:22] [INFO ] Implicit Places using invariants in 296 ms returned [480, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 299 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1349 places, 417/1209 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 495 transition count 416
Applied a total of 2 rules in 17 ms. Remains 495 /496 variables (removed 1) and now considering 416/417 (removed 1) transitions.
// Phase 1: matrix 416 rows 495 cols
[2024-05-29 12:19:22] [INFO ] Computed 218 invariants in 5 ms
[2024-05-29 12:19:22] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-29 12:19:22] [INFO ] Invariant cache hit.
[2024-05-29 12:19:23] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1349 places, 416/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1359 ms. Remains : 495/1349 places, 416/1209 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s482 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 602 reset in 457 ms.
Stack based approach found an accepted trace after 8895 steps with 48 reset with depth 44 and stack size 43 in 48 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-02 finished in 1975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||X(F(p2))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 117 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 12:19:24] [INFO ] Computed 221 invariants in 9 ms
[2024-05-29 12:19:24] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-29 12:19:24] [INFO ] Invariant cache hit.
[2024-05-29 12:19:25] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2024-05-29 12:19:25] [INFO ] Invariant cache hit.
[2024-05-29 12:19:26] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2406 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s266 1), p0:(EQ s234 1), p1:(EQ s356 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 470 ms.
Stack based approach found an accepted trace after 5920 steps with 0 reset with depth 5921 and stack size 5921 in 34 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-03 finished in 3201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0||(X((p2 U p3))&&p1))) U p4))))'
Support contains 7 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 117 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
[2024-05-29 12:19:27] [INFO ] Invariant cache hit.
[2024-05-29 12:19:27] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-29 12:19:27] [INFO ] Invariant cache hit.
[2024-05-29 12:19:28] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2024-05-29 12:19:28] [INFO ] Invariant cache hit.
[2024-05-29 12:19:29] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2456 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p4), (NOT p4), (NOT p4), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p4), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p4) (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s645 1) (EQ s682 1)), p0:(EQ s86 1), p1:(AND (EQ s1307 1) (EQ s1331 1)), p3:(EQ s884 1), p2:(EQ s483 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 552 ms.
Stack based approach found an accepted trace after 8606 steps with 0 reset with depth 8607 and stack size 7346 in 77 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-04 finished in 3441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1349 transition count 930
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1070 transition count 930
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 558 place count 1070 transition count 775
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 868 place count 915 transition count 775
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 874 place count 909 transition count 769
Iterating global reduction 2 with 6 rules applied. Total rules applied 880 place count 909 transition count 769
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 880 place count 909 transition count 763
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 892 place count 903 transition count 763
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1572 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1573 place count 563 transition count 422
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 1575 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1693 place count 503 transition count 421
Applied a total of 1693 rules in 143 ms. Remains 503 /1349 variables (removed 846) and now considering 421/1209 (removed 788) transitions.
// Phase 1: matrix 421 rows 503 cols
[2024-05-29 12:19:30] [INFO ] Computed 221 invariants in 3 ms
[2024-05-29 12:19:31] [INFO ] Implicit Places using invariants in 320 ms returned [496]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 322 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/1349 places, 421/1209 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 502 transition count 419
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 500 transition count 419
Applied a total of 4 rules in 11 ms. Remains 500 /502 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 500 cols
[2024-05-29 12:19:31] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 12:19:31] [INFO ] Implicit Places using invariants in 293 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 295 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 498/1349 places, 419/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 496 transition count 417
Applied a total of 4 rules in 17 ms. Remains 496 /498 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 496 cols
[2024-05-29 12:19:31] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 12:19:31] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-29 12:19:31] [INFO ] Invariant cache hit.
[2024-05-29 12:19:31] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-05-29 12:19:33] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 496/1349 places, 417/1209 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2393 ms. Remains : 496/1349 places, 417/1209 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s252 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 31 reset in 473 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-06 finished in 3037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p0)&&F((G(F(p1))||(!p2&&F(p1)))))))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 116 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 12:19:33] [INFO ] Computed 221 invariants in 9 ms
[2024-05-29 12:19:34] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-29 12:19:34] [INFO ] Invariant cache hit.
[2024-05-29 12:19:35] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2024-05-29 12:19:35] [INFO ] Invariant cache hit.
[2024-05-29 12:19:36] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2520 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s154 0)), p1:(NEQ s158 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 441 ms.
Product exploration explored 100000 steps with 24 reset in 657 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1341 stabilizing places and 318/1201 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:19:37] [INFO ] Invariant cache hit.
[2024-05-29 12:19:38] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:19:38] [INFO ] [Nat]Absence check using 221 positive place invariants in 66 ms returned sat
[2024-05-29 12:19:38] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 0 ms to minimize.
[2024-05-29 12:19:39] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 1 ms to minimize.
[2024-05-29 12:19:40] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 0 ms to minimize.
[2024-05-29 12:19:40] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 0 ms to minimize.
[2024-05-29 12:19:40] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 1 ms to minimize.
[2024-05-29 12:19:40] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2024-05-29 12:19:40] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2024-05-29 12:19:41] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 12 ms to minimize.
[2024-05-29 12:19:41] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 2 ms to minimize.
[2024-05-29 12:19:41] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 0 ms to minimize.
[2024-05-29 12:19:41] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2024-05-29 12:19:42] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 0 ms to minimize.
[2024-05-29 12:19:42] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 0 ms to minimize.
[2024-05-29 12:19:42] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2024-05-29 12:19:42] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2024-05-29 12:19:42] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2024-05-29 12:19:43] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 0 ms to minimize.
[2024-05-29 12:19:43] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2024-05-29 12:19:43] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2024-05-29 12:19:43] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 0 ms to minimize.
[2024-05-29 12:19:43] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2024-05-29 12:19:44] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2024-05-29 12:19:44] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2024-05-29 12:19:44] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-29 12:19:44] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2024-05-29 12:19:44] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2024-05-29 12:19:44] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5844 ms
[2024-05-29 12:19:44] [INFO ] After 6417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-29 12:19:44] [INFO ] After 6720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1341 transition count 921
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1061 transition count 921
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 560 place count 1061 transition count 762
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
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 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1736 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1737 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1738 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1738 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1742 place count 499 transition count 418
Applied a total of 1742 rules in 158 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 499/1341 places, 418/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 91608 steps, run visited all 1 properties in 591 ms. (steps per millisecond=155 )
Probabilistic random walk after 91608 steps, saw 74178 distinct states, run finished after 591 ms. (steps per millisecond=155 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 3 out of 1341 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1340 transition count 920
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1060 transition count 920
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1060 transition count 762
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 902 transition count 762
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1544 place count 568 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1545 place count 568 transition count 427
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 1547 place count 567 transition count 426
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1665 place count 508 transition count 426
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1667 place count 506 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1668 place count 505 transition count 424
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1668 place count 505 transition count 422
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1672 place count 503 transition count 422
Applied a total of 1672 rules in 142 ms. Remains 503 /1341 variables (removed 838) and now considering 422/1201 (removed 779) transitions.
// Phase 1: matrix 422 rows 503 cols
[2024-05-29 12:19:46] [INFO ] Computed 220 invariants in 9 ms
[2024-05-29 12:19:46] [INFO ] Implicit Places using invariants in 578 ms returned [486, 490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 592 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1341 places, 422/1201 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 499 transition count 420
Applied a total of 4 rules in 14 ms. Remains 499 /501 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 499 cols
[2024-05-29 12:19:46] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 12:19:47] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-29 12:19:47] [INFO ] Invariant cache hit.
[2024-05-29 12:19:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 12:19:47] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 499/1341 places, 420/1201 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1567 ms. Remains : 499/1341 places, 420/1201 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/499 stabilizing places and 2/420 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:19:48] [INFO ] Invariant cache hit.
[2024-05-29 12:19:48] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:19:48] [INFO ] [Nat]Absence check using 218 positive place invariants in 32 ms returned sat
[2024-05-29 12:19:48] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:19:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 12:19:48] [INFO ] After 18ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:19:48] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 12:19:48] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 420/420 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 499 transition count 419
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 498 transition count 419
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 496 transition count 417
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 496 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 495 transition count 416
Applied a total of 10 rules in 32 ms. Remains 495 /499 variables (removed 4) and now considering 416/420 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 495/499 places, 416/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 471553 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 471553 steps, saw 351196 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2024-05-29 12:19:51] [INFO ] Computed 218 invariants in 5 ms
[2024-05-29 12:19:51] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:19:51] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2024-05-29 12:19:52] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:19:52] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-29 12:19:52] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 9 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 495/495 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 35 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-05-29 12:19:52] [INFO ] Invariant cache hit.
[2024-05-29 12:19:52] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-29 12:19:52] [INFO ] Invariant cache hit.
[2024-05-29 12:19:53] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2024-05-29 12:19:53] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:19:53] [INFO ] Invariant cache hit.
[2024-05-29 12:19:53] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1121 ms. Remains : 495/495 places, 416/416 transitions.
Partial Free-agglomeration rule applied 114 times.
Drop transitions removed 114 transitions
Iterating global reduction 0 with 114 rules applied. Total rules applied 114 place count 495 transition count 416
Applied a total of 114 rules in 17 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2024-05-29 12:19:53] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:19:53] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:19:53] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2024-05-29 12:19:53] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:19:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 12:19:53] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:19:53] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 12:19:53] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 8 reset in 487 ms.
Product exploration explored 100000 steps with 1 reset in 574 ms.
Built C files in :
/tmp/ltsmin14134113468242886653
[2024-05-29 12:19:55] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2024-05-29 12:19:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:55] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2024-05-29 12:19:55] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:55] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2024-05-29 12:19:55] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:55] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14134113468242886653
Running compilation step : cd /tmp/ltsmin14134113468242886653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1041 ms.
Running link step : cd /tmp/ltsmin14134113468242886653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin14134113468242886653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14126779820558383617.hoa' '--buchi-type=spotba'
LTSmin run took 6589 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-020B-LTLFireability-07 finished in 29572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1348 transition count 931
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 1071 transition count 930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 1070 transition count 930
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 556 place count 1070 transition count 775
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 866 place count 915 transition count 775
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 872 place count 909 transition count 769
Iterating global reduction 3 with 6 rules applied. Total rules applied 878 place count 909 transition count 769
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 878 place count 909 transition count 763
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 890 place count 903 transition count 763
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1568 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1569 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1571 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1687 place count 505 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1689 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1690 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1690 place count 502 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1694 place count 500 transition count 418
Applied a total of 1694 rules in 179 ms. Remains 500 /1349 variables (removed 849) and now considering 418/1209 (removed 791) transitions.
// Phase 1: matrix 418 rows 500 cols
[2024-05-29 12:20:03] [INFO ] Computed 220 invariants in 4 ms
[2024-05-29 12:20:03] [INFO ] Implicit Places using invariants in 305 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 325 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/1349 places, 418/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 496 transition count 416
Applied a total of 4 rules in 13 ms. Remains 496 /498 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 496 cols
[2024-05-29 12:20:03] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:20:04] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-29 12:20:04] [INFO ] Invariant cache hit.
[2024-05-29 12:20:04] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/1349 places, 416/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1329 ms. Remains : 496/1349 places, 416/1209 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s477 1), p1:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2 reset in 387 ms.
Stack based approach found an accepted trace after 374 steps with 1 reset with depth 359 and stack size 359 in 2 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-08 finished in 1848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1348 transition count 929
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1069 transition count 929
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 558 place count 1069 transition count 774
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 868 place count 914 transition count 774
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 874 place count 908 transition count 768
Iterating global reduction 2 with 6 rules applied. Total rules applied 880 place count 908 transition count 768
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 880 place count 908 transition count 762
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 892 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1570 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1571 place count 563 transition count 422
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 1573 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1691 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1693 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1694 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1694 place count 500 transition count 417
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1698 place count 498 transition count 417
Applied a total of 1698 rules in 137 ms. Remains 498 /1349 variables (removed 851) and now considering 417/1209 (removed 792) transitions.
// Phase 1: matrix 417 rows 498 cols
[2024-05-29 12:20:05] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 12:20:05] [INFO ] Implicit Places using invariants in 298 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 309 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1349 places, 417/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 415
Applied a total of 4 rules in 16 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2024-05-29 12:20:05] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:20:05] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-29 12:20:05] [INFO ] Invariant cache hit.
[2024-05-29 12:20:06] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1349 places, 415/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1377 ms. Remains : 494/1349 places, 415/1209 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 425 ms.
Stack based approach found an accepted trace after 1435 steps with 0 reset with depth 1436 and stack size 1416 in 8 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 1858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 131 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2024-05-29 12:20:07] [INFO ] Computed 221 invariants in 11 ms
[2024-05-29 12:20:07] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-29 12:20:07] [INFO ] Invariant cache hit.
[2024-05-29 12:20:08] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2024-05-29 12:20:08] [INFO ] Invariant cache hit.
[2024-05-29 12:20:09] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2447 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s260 1), p1:(AND (EQ s1171 1) (EQ s1264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 388 ms.
Stack based approach found an accepted trace after 1455 steps with 0 reset with depth 1456 and stack size 1456 in 6 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-10 finished in 2971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 108 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 12:20:10] [INFO ] Computed 221 invariants in 10 ms
[2024-05-29 12:20:10] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-29 12:20:10] [INFO ] Invariant cache hit.
[2024-05-29 12:20:11] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
[2024-05-29 12:20:11] [INFO ] Invariant cache hit.
[2024-05-29 12:20:12] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2414 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1027 1) (EQ s1052 1)), p1:(AND (EQ s586 1) (EQ s635 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 56 reset in 372 ms.
Product exploration explored 100000 steps with 37 reset in 451 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:20:13] [INFO ] Invariant cache hit.
[2024-05-29 12:20:14] [INFO ] [Real]Absence check using 221 positive place invariants in 60 ms returned sat
[2024-05-29 12:20:14] [INFO ] After 521ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 12:20:14] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2024-05-29 12:20:15] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 0 ms to minimize.
[2024-05-29 12:20:15] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 0 ms to minimize.
[2024-05-29 12:20:15] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 0 ms to minimize.
[2024-05-29 12:20:16] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 1 ms to minimize.
[2024-05-29 12:20:16] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2024-05-29 12:20:16] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 1 ms to minimize.
[2024-05-29 12:20:16] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 0 ms to minimize.
[2024-05-29 12:20:17] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2024-05-29 12:20:17] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 0 ms to minimize.
[2024-05-29 12:20:17] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2024-05-29 12:20:17] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 1 ms to minimize.
[2024-05-29 12:20:17] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2024-05-29 12:20:18] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2024-05-29 12:20:18] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2024-05-29 12:20:18] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 0 ms to minimize.
[2024-05-29 12:20:18] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2024-05-29 12:20:19] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2024-05-29 12:20:19] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-29 12:20:19] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 12:20:19] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2024-05-29 12:20:19] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-05-29 12:20:19] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2024-05-29 12:20:20] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2024-05-29 12:20:20] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5488 ms
[2024-05-29 12:20:20] [INFO ] After 6070ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:20:20] [INFO ] After 6290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:20:20] [INFO ] [Nat]Absence check using 221 positive place invariants in 57 ms returned sat
[2024-05-29 12:20:20] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:20:21] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 0 ms to minimize.
[2024-05-29 12:20:21] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2024-05-29 12:20:21] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 1 ms to minimize.
[2024-05-29 12:20:22] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2024-05-29 12:20:22] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2024-05-29 12:20:22] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 1 ms to minimize.
[2024-05-29 12:20:22] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 0 ms to minimize.
[2024-05-29 12:20:23] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2024-05-29 12:20:23] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 0 ms to minimize.
[2024-05-29 12:20:23] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2024-05-29 12:20:23] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 1 ms to minimize.
[2024-05-29 12:20:24] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 0 ms to minimize.
[2024-05-29 12:20:24] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2024-05-29 12:20:24] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 2 ms to minimize.
[2024-05-29 12:20:24] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2024-05-29 12:20:24] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2024-05-29 12:20:25] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2024-05-29 12:20:25] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
[2024-05-29 12:20:25] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 0 ms to minimize.
[2024-05-29 12:20:25] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2024-05-29 12:20:25] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2024-05-29 12:20:25] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-29 12:20:26] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:20:26] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2024-05-29 12:20:26] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-29 12:20:26] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:20:26] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-29 12:20:26] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2024-05-29 12:20:26] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-29 12:20:27] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6094 ms
[2024-05-29 12:20:27] [INFO ] After 6627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 12:20:27] [INFO ] After 6920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
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 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1741 place count 499 transition count 418
Applied a total of 1741 rules in 125 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 499/1341 places, 418/1201 transitions.
Finished random walk after 2057 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=171 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 54 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-29 12:20:27] [INFO ] Invariant cache hit.
[2024-05-29 12:20:28] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-29 12:20:28] [INFO ] Invariant cache hit.
[2024-05-29 12:20:29] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-05-29 12:20:29] [INFO ] Invariant cache hit.
[2024-05-29 12:20:30] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2315 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:20:30] [INFO ] Invariant cache hit.
[2024-05-29 12:20:30] [INFO ] [Real]Absence check using 221 positive place invariants in 60 ms returned sat
[2024-05-29 12:20:31] [INFO ] After 493ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 12:20:31] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 1 ms to minimize.
[2024-05-29 12:20:31] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2024-05-29 12:20:32] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 1 ms to minimize.
[2024-05-29 12:20:32] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 0 ms to minimize.
[2024-05-29 12:20:32] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 1 ms to minimize.
[2024-05-29 12:20:32] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 0 ms to minimize.
[2024-05-29 12:20:33] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2024-05-29 12:20:33] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 0 ms to minimize.
[2024-05-29 12:20:33] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 0 ms to minimize.
[2024-05-29 12:20:33] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 0 ms to minimize.
[2024-05-29 12:20:34] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2024-05-29 12:20:34] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2024-05-29 12:20:34] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 0 ms to minimize.
[2024-05-29 12:20:34] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2024-05-29 12:20:35] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 1 ms to minimize.
[2024-05-29 12:20:35] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 1 ms to minimize.
[2024-05-29 12:20:35] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2024-05-29 12:20:35] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2024-05-29 12:20:35] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2024-05-29 12:20:36] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2024-05-29 12:20:36] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-29 12:20:36] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2024-05-29 12:20:36] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:20:36] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2024-05-29 12:20:36] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5413 ms
[2024-05-29 12:20:36] [INFO ] After 5946ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:20:36] [INFO ] After 6184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:20:36] [INFO ] [Nat]Absence check using 221 positive place invariants in 59 ms returned sat
[2024-05-29 12:20:37] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:20:37] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2024-05-29 12:20:38] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 0 ms to minimize.
[2024-05-29 12:20:38] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 0 ms to minimize.
[2024-05-29 12:20:38] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 0 ms to minimize.
[2024-05-29 12:20:38] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-05-29 12:20:39] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2024-05-29 12:20:39] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 1 ms to minimize.
[2024-05-29 12:20:39] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2024-05-29 12:20:39] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2024-05-29 12:20:40] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 0 ms to minimize.
[2024-05-29 12:20:40] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 0 ms to minimize.
[2024-05-29 12:20:40] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 1 ms to minimize.
[2024-05-29 12:20:40] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2024-05-29 12:20:40] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 1 ms to minimize.
[2024-05-29 12:20:41] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2024-05-29 12:20:41] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2024-05-29 12:20:41] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2024-05-29 12:20:41] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 0 ms to minimize.
[2024-05-29 12:20:41] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2024-05-29 12:20:42] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2024-05-29 12:20:42] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2024-05-29 12:20:42] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2024-05-29 12:20:42] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2024-05-29 12:20:42] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2024-05-29 12:20:42] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2024-05-29 12:20:43] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2024-05-29 12:20:43] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-29 12:20:43] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2024-05-29 12:20:43] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2024-05-29 12:20:43] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5975 ms
[2024-05-29 12:20:43] [INFO ] After 6513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-29 12:20:43] [INFO ] After 6811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
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 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1741 place count 499 transition count 418
Applied a total of 1741 rules in 118 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 499/1341 places, 418/1201 transitions.
Finished random walk after 806 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 48 reset in 376 ms.
Product exploration explored 100000 steps with 39 reset in 462 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1341 transition count 1280
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1341 transition count 1280
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 1 with 378 rules applied. Total rules applied 756 place count 1341 transition count 1280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 757 place count 1341 transition count 1279
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 899 place count 1199 transition count 1137
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 142 rules applied. Total rules applied 1041 place count 1199 transition count 1137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1199 transition count 1137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1197 transition count 1135
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1197 transition count 1135
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -333
Deduced a syphon composed of 692 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1125 place count 1197 transition count 1468
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1204 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1283 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Applied a total of 1283 rules in 668 ms. Remains 1118 /1341 variables (removed 223) and now considering 1310/1201 (removed -109) transitions.
[2024-05-29 12:20:46] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1310 rows 1118 cols
[2024-05-29 12:20:46] [INFO ] Computed 221 invariants in 6 ms
[2024-05-29 12:20:47] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1118/1341 places, 1310/1201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1902 ms. Remains : 1118/1341 places, 1310/1201 transitions.
Built C files in :
/tmp/ltsmin8116869827279179999
[2024-05-29 12:20:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8116869827279179999
Running compilation step : cd /tmp/ltsmin8116869827279179999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1992 ms.
Running link step : cd /tmp/ltsmin8116869827279179999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8116869827279179999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9286289283976192173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 42 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 12:21:02] [INFO ] Computed 221 invariants in 7 ms
[2024-05-29 12:21:03] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-29 12:21:03] [INFO ] Invariant cache hit.
[2024-05-29 12:21:04] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
[2024-05-29 12:21:04] [INFO ] Invariant cache hit.
[2024-05-29 12:21:05] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2460 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Built C files in :
/tmp/ltsmin5395814745358322954
[2024-05-29 12:21:05] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5395814745358322954
Running compilation step : cd /tmp/ltsmin5395814745358322954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2088 ms.
Running link step : cd /tmp/ltsmin5395814745358322954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5395814745358322954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17439691309120272525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 12:21:20] [INFO ] Flatten gal took : 45 ms
[2024-05-29 12:21:20] [INFO ] Flatten gal took : 42 ms
[2024-05-29 12:21:20] [INFO ] Time to serialize gal into /tmp/LTL3251240843420532295.gal : 8 ms
[2024-05-29 12:21:20] [INFO ] Time to serialize properties into /tmp/LTL5122730513826713463.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3251240843420532295.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1830577025192130012.hoa' '-atoms' '/tmp/LTL5122730513826713463.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5122730513826713463.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1830577025192130012.hoa
Detected timeout of ITS tools.
[2024-05-29 12:21:35] [INFO ] Flatten gal took : 38 ms
[2024-05-29 12:21:35] [INFO ] Flatten gal took : 38 ms
[2024-05-29 12:21:35] [INFO ] Time to serialize gal into /tmp/LTL1242501900887182477.gal : 7 ms
[2024-05-29 12:21:35] [INFO ] Time to serialize properties into /tmp/LTL11823552275588384291.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1242501900887182477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11823552275588384291.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p1192!=1)||(p1219!=1))")))||((F("((p1192!=1)||(p1219!=1))"))&&(X(X(F("((p675==1)&&(p734==1))"))))))))
Formula 0 simplified : X(FG!"((p1192!=1)||(p1219!=1))" & (G!"((p1192!=1)||(p1219!=1))" | XXG!"((p675==1)&&(p734==1))"))
Detected timeout of ITS tools.
[2024-05-29 12:21:50] [INFO ] Flatten gal took : 34 ms
[2024-05-29 12:21:50] [INFO ] Applying decomposition
[2024-05-29 12:21:50] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6598819729320704660.txt' '-o' '/tmp/graph6598819729320704660.bin' '-w' '/tmp/graph6598819729320704660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6598819729320704660.bin' '-l' '-1' '-v' '-w' '/tmp/graph6598819729320704660.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:21:50] [INFO ] Decomposing Gal with order
[2024-05-29 12:21:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:21:51] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-29 12:21:51] [INFO ] Flatten gal took : 111 ms
[2024-05-29 12:21:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 12:21:51] [INFO ] Time to serialize gal into /tmp/LTL6048513179317217272.gal : 17 ms
[2024-05-29 12:21:51] [INFO ] Time to serialize properties into /tmp/LTL13966045221240045002.ltl : 27 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6048513179317217272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13966045221240045002.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i15.i1.i1.u366.p1192!=1)||(i15.i2.i1.u371.p1219!=1))")))||((F("((i15.i1.i1.u366.p1192!=1)||(i15.i2.i1.u371.p1219!=1))"))&...211
Formula 0 simplified : X(FG!"((i15.i1.i1.u366.p1192!=1)||(i15.i2.i1.u371.p1219!=1))" & (G!"((i15.i1.i1.u366.p1192!=1)||(i15.i2.i1.u371.p1219!=1))" | XXG!"(...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13530253880987445307
[2024-05-29 12:22:06] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13530253880987445307
Running compilation step : cd /tmp/ltsmin13530253880987445307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2148 ms.
Running link step : cd /tmp/ltsmin13530253880987445307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13530253880987445307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 131551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1343 transition count 1203
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1343 transition count 1203
Applied a total of 12 rules in 70 ms. Remains 1343 /1349 variables (removed 6) and now considering 1203/1209 (removed 6) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-05-29 12:22:21] [INFO ] Computed 221 invariants in 10 ms
[2024-05-29 12:22:21] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-29 12:22:21] [INFO ] Invariant cache hit.
[2024-05-29 12:22:23] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2024-05-29 12:22:23] [INFO ] Invariant cache hit.
[2024-05-29 12:22:23] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/1349 places, 1203/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2273 ms. Remains : 1343/1349 places, 1203/1209 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s141 1) (EQ s528 1) (EQ s1305 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Product exploration explored 100000 steps with 50000 reset in 761 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLFireability-12 finished in 3967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p1)&&p0))))'
Support contains 5 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 89 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 12:22:25] [INFO ] Computed 221 invariants in 6 ms
[2024-05-29 12:22:25] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-29 12:22:25] [INFO ] Invariant cache hit.
[2024-05-29 12:22:27] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
[2024-05-29 12:22:27] [INFO ] Invariant cache hit.
[2024-05-29 12:22:27] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2337 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s369 1) (EQ s409 1) (EQ s803 1)), p1:(AND (EQ s495 1) (EQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 383 ms.
Stack based approach found an accepted trace after 1606 steps with 0 reset with depth 1607 and stack size 1607 in 7 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-13 finished in 2891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1348 transition count 930
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1070 transition count 930
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 556 place count 1070 transition count 775
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 866 place count 915 transition count 775
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 872 place count 909 transition count 769
Iterating global reduction 2 with 6 rules applied. Total rules applied 878 place count 909 transition count 769
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 878 place count 909 transition count 763
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 890 place count 903 transition count 763
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1566 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1567 place count 565 transition count 424
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 1569 place count 564 transition count 423
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1687 place count 505 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1689 place count 503 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1690 place count 502 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1690 place count 502 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1694 place count 500 transition count 419
Applied a total of 1694 rules in 133 ms. Remains 500 /1349 variables (removed 849) and now considering 419/1209 (removed 790) transitions.
// Phase 1: matrix 419 rows 500 cols
[2024-05-29 12:22:28] [INFO ] Computed 220 invariants in 1 ms
[2024-05-29 12:22:29] [INFO ] Implicit Places using invariants in 636 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 639 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/1349 places, 419/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 496 transition count 417
Applied a total of 4 rules in 10 ms. Remains 496 /498 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 496 cols
[2024-05-29 12:22:29] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:22:29] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-29 12:22:29] [INFO ] Invariant cache hit.
[2024-05-29 12:22:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:22:30] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/1349 places, 417/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1705 ms. Remains : 496/1349 places, 417/1209 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s169 1), p1:(EQ s375 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 393 ms.
Stack based approach found an accepted trace after 392 steps with 0 reset with depth 393 and stack size 393 in 2 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-14 finished in 2227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1348 transition count 929
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1069 transition count 929
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 558 place count 1069 transition count 774
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 868 place count 914 transition count 774
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 875 place count 907 transition count 767
Iterating global reduction 2 with 7 rules applied. Total rules applied 882 place count 907 transition count 767
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 882 place count 907 transition count 760
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 896 place count 900 transition count 760
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1568 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1569 place count 564 transition count 423
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 1571 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1689 place count 504 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1692 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1692 place count 501 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1696 place count 499 transition count 418
Applied a total of 1696 rules in 119 ms. Remains 499 /1349 variables (removed 850) and now considering 418/1209 (removed 791) transitions.
// Phase 1: matrix 418 rows 499 cols
[2024-05-29 12:22:30] [INFO ] Computed 220 invariants in 1 ms
[2024-05-29 12:22:30] [INFO ] Implicit Places using invariants in 292 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 296 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1349 places, 418/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 10 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2024-05-29 12:22:30] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:22:31] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-29 12:22:31] [INFO ] Invariant cache hit.
[2024-05-29 12:22:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:22:31] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1349 places, 416/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1275 ms. Remains : 495/1349 places, 416/1209 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s353 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19247 reset in 436 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-15 finished in 1765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-020B-LTLFireability-11
Stuttering acceptance computed with spot in 247 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1348 transition count 931
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 1071 transition count 931
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 554 place count 1071 transition count 776
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 864 place count 916 transition count 776
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 871 place count 909 transition count 769
Iterating global reduction 2 with 7 rules applied. Total rules applied 878 place count 909 transition count 769
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 878 place count 909 transition count 762
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 892 place count 902 transition count 762
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1564 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1565 place count 566 transition count 425
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 1567 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1685 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1688 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 420
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1692 place count 501 transition count 420
Applied a total of 1692 rules in 140 ms. Remains 501 /1349 variables (removed 848) and now considering 420/1209 (removed 789) transitions.
// Phase 1: matrix 420 rows 501 cols
[2024-05-29 12:22:32] [INFO ] Computed 220 invariants in 1 ms
[2024-05-29 12:22:33] [INFO ] Implicit Places using invariants in 350 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 351 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/1349 places, 420/1209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 418
Applied a total of 4 rules in 11 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2024-05-29 12:22:33] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 12:22:33] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-29 12:22:33] [INFO ] Invariant cache hit.
[2024-05-29 12:22:33] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 497/1349 places, 418/1209 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1285 ms. Remains : 497/1349 places, 418/1209 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s383 1) (EQ s399 1)), p1:(AND (EQ s220 1) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 412 ms.
Stack based approach found an accepted trace after 61840 steps with 121 reset with depth 90 and stack size 90 in 312 ms.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 2362 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-29 12:22:34] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5514965187173575098
[2024-05-29 12:22:34] [INFO ] Computing symmetric may disable matrix : 1209 transitions.
[2024-05-29 12:22:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:22:34] [INFO ] Computing symmetric may enable matrix : 1209 transitions.
[2024-05-29 12:22:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:22:34] [INFO ] Applying decomposition
[2024-05-29 12:22:34] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8406404980630395600.txt' '-o' '/tmp/graph8406404980630395600.bin' '-w' '/tmp/graph8406404980630395600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8406404980630395600.bin' '-l' '-1' '-v' '-w' '/tmp/graph8406404980630395600.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:22:34] [INFO ] Decomposing Gal with order
[2024-05-29 12:22:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:22:34] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-29 12:22:35] [INFO ] Flatten gal took : 69 ms
[2024-05-29 12:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 12:22:35] [INFO ] Time to serialize gal into /tmp/LTLFireability3615517488613674211.gal : 23 ms
[2024-05-29 12:22:35] [INFO ] Time to serialize properties into /tmp/LTLFireability5907286250249372785.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3615517488613674211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5907286250249372785.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
[2024-05-29 12:22:35] [INFO ] Computing Do-Not-Accords matrix : 1209 transitions.
[2024-05-29 12:22:35] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:22:35] [INFO ] Built C files in 450ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5514965187173575098
Running compilation step : cd /tmp/ltsmin5514965187173575098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X((G(F(!("((i15.u372.p1192==1)&&(i15.u377.p1219==1))"))))||((F(!("((i15.u372.p1192==1)&&(i15.u377.p1219==1))")))&&(X(X(F("((i8.u213...193
Formula 0 simplified : X(FG"((i15.u372.p1192==1)&&(i15.u377.p1219==1))" & (G"((i15.u372.p1192==1)&&(i15.u377.p1219==1))" | XXG!"((i8.u213.p675==1)&&(i9.u23...169
Compilation finished in 3793 ms.
Running link step : cd /tmp/ltsmin5514965187173575098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin5514965187173575098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 12:43:57] [INFO ] Applying decomposition
[2024-05-29 12:43:58] [INFO ] Flatten gal took : 270 ms
[2024-05-29 12:43:58] [INFO ] Decomposing Gal with order
[2024-05-29 12:43:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:44:00] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-29 12:44:01] [INFO ] Flatten gal took : 1620 ms
[2024-05-29 12:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 995 ms.
[2024-05-29 12:44:04] [INFO ] Time to serialize gal into /tmp/LTLFireability11727561984999957887.gal : 181 ms
[2024-05-29 12:44:04] [INFO ] Time to serialize properties into /tmp/LTLFireability8219457637864940472.ltl : 201 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11727561984999957887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8219457637864940472.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F(!("((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u345.p1192==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.u353.p1219==1))"))))||((F(!("((i0.i0.i0.i0...387
Formula 0 simplified : X(FG"((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u345.p1192==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.u353.p1219==1))" & (G"((i0.i0.i0.i0.i1.i0.i0.i0....363
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( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.347: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.347: LTL layer: formula: X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&X(X(<>((LTLAPp1==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.347: "X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&X(X(<>((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.348: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.357: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.361: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.358: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.359: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.362: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.365: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.424: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.427: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.368: DFS-FIFO for weak LTL, using special progress label 1212
pins2lts-mc-linux64( 0/ 8), 1.368: There are 1213 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.368: State length is 1350, there are 1218 groups
pins2lts-mc-linux64( 0/ 8), 1.368: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.368: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.368: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.368: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 2.205: ~1 levels ~960 states ~5728 transitions
pins2lts-mc-linux64( 0/ 8), 2.556: ~1 levels ~1920 states ~12456 transitions
pins2lts-mc-linux64( 3/ 8), 3.183: ~1 levels ~3840 states ~29200 transitions
pins2lts-mc-linux64( 0/ 8), 4.853: ~1 levels ~7680 states ~55128 transitions
pins2lts-mc-linux64( 0/ 8), 7.782: ~1 levels ~15360 states ~111536 transitions
pins2lts-mc-linux64( 0/ 8), 13.579: ~1 levels ~30720 states ~242000 transitions
pins2lts-mc-linux64( 0/ 8), 22.006: ~1 levels ~61440 states ~489272 transitions
pins2lts-mc-linux64( 0/ 8), 27.102: ~1 levels ~122880 states ~1059104 transitions
pins2lts-mc-linux64( 0/ 8), 37.294: ~1 levels ~245760 states ~2207232 transitions
pins2lts-mc-linux64( 0/ 8), 56.878: ~1 levels ~491520 states ~4740600 transitions
pins2lts-mc-linux64( 0/ 8), 94.792: ~1 levels ~983040 states ~10218472 transitions
pins2lts-mc-linux64( 0/ 8), 192.567: ~1 levels ~1966080 states ~21357696 transitions
pins2lts-mc-linux64( 0/ 8), 347.892: ~1 levels ~3932160 states ~44414472 transitions
pins2lts-mc-linux64( 0/ 8), 661.345: ~1 levels ~7864320 states ~92227176 transitions
pins2lts-mc-linux64( 0/ 8), 1314.231: ~1 levels ~15728640 states ~193684176 transitions
pins2lts-mc-linux64( 2/ 8), 1542.833: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1542.922:
pins2lts-mc-linux64( 0/ 8), 1542.922: mean standard work distribution: 24.5% (states) 22.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1542.922:
pins2lts-mc-linux64( 0/ 8), 1542.922: Explored 12795756 states 165979360 transitions, fanout: 12.971
pins2lts-mc-linux64( 0/ 8), 1542.922: Total exploration time 1541.530 sec (1541.410 sec minimum, 1541.488 sec on average)
pins2lts-mc-linux64( 0/ 8), 1542.922: States per second: 8301, Transitions per second: 107672
pins2lts-mc-linux64( 0/ 8), 1542.922:
pins2lts-mc-linux64( 0/ 8), 1542.922: Progress states detected: 31439187
pins2lts-mc-linux64( 0/ 8), 1542.922: Redundant explorations: -59.3001
pins2lts-mc-linux64( 0/ 8), 1542.922:
pins2lts-mc-linux64( 0/ 8), 1542.923: Queue width: 8B, total height: 29006120, memory: 221.30MB
pins2lts-mc-linux64( 0/ 8), 1542.923: Tree memory: 495.9MB, 16.5 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1542.923: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1542.923: Stored 1237 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1542.923: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1542.923: Est. total memory use: 717.2MB (~1245.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5514965187173575098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5514965187173575098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&X(X(<>((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.
[2024-05-29 13:05:28] [INFO ] Flatten gal took : 708 ms
[2024-05-29 13:05:30] [INFO ] Input system was already deterministic with 1209 transitions.
[2024-05-29 13:05:31] [INFO ] Transformed 1349 places.
[2024-05-29 13:05:31] [INFO ] Transformed 1209 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
[2024-05-29 13:05:31] [INFO ] Time to serialize gal into /tmp/LTLFireability2666920295997715061.gal : 32 ms
[2024-05-29 13:05:31] [INFO ] Time to serialize properties into /tmp/LTLFireability9565054387979649504.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2666920295997715061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9565054387979649504.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.202304061127/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((G(F(!("((p1192==1)&&(p1219==1))"))))||((F(!("((p1192==1)&&(p1219==1))")))&&(X(X(F("((p675==1)&&(p734==1))"))))))))
Formula 0 simplified : X(FG"((p1192==1)&&(p1219==1))" & (G"((p1192==1)&&(p1219==1))" | XXG!"((p675==1)&&(p734==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 200180 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16119340 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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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