Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800140.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 8.5K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 498K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679300261458

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 08:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:17:43] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-20 08:17:43] [INFO ] Transformed 1603 places.
[2023-03-20 08:17:43] [INFO ] Transformed 1803 transitions.
[2023-03-20 08:17:43] [INFO ] Found NUPN structural information;
[2023-03-20 08:17:43] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-040B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 272 place count 1331 transition count 1531
Iterating global reduction 0 with 272 rules applied. Total rules applied 544 place count 1331 transition count 1531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 545 place count 1330 transition count 1530
Iterating global reduction 0 with 1 rules applied. Total rules applied 546 place count 1330 transition count 1530
Applied a total of 546 rules in 279 ms. Remains 1330 /1603 variables (removed 273) and now considering 1530/1803 (removed 273) transitions.
// Phase 1: matrix 1530 rows 1330 cols
[2023-03-20 08:17:43] [INFO ] Computed 161 place invariants in 26 ms
[2023-03-20 08:17:44] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-20 08:17:44] [INFO ] Invariant cache hit.
[2023-03-20 08:17:46] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2605 ms to find 0 implicit places.
[2023-03-20 08:17:46] [INFO ] Invariant cache hit.
[2023-03-20 08:17:47] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1330/1603 places, 1530/1803 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3565 ms. Remains : 1330/1603 places, 1530/1803 transitions.
Support contains 44 out of 1330 places after structural reductions.
[2023-03-20 08:17:47] [INFO ] Flatten gal took : 141 ms
[2023-03-20 08:17:47] [INFO ] Flatten gal took : 130 ms
[2023-03-20 08:17:47] [INFO ] Input system was already deterministic with 1530 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 29) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 08:17:48] [INFO ] Invariant cache hit.
[2023-03-20 08:17:48] [INFO ] [Real]Absence check using 161 positive place invariants in 47 ms returned sat
[2023-03-20 08:17:50] [INFO ] After 1907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 08:17:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 96 ms returned sat
[2023-03-20 08:17:52] [INFO ] After 1423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 08:17:53] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 5 ms to minimize.
[2023-03-20 08:17:53] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 1 ms to minimize.
[2023-03-20 08:17:53] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 1 ms to minimize.
[2023-03-20 08:17:53] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 1 ms to minimize.
[2023-03-20 08:17:54] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 1 ms to minimize.
[2023-03-20 08:17:54] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 0 ms to minimize.
[2023-03-20 08:17:54] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 1 ms to minimize.
[2023-03-20 08:17:54] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 1 ms to minimize.
[2023-03-20 08:17:55] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 0 ms to minimize.
[2023-03-20 08:17:55] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:17:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2693 ms
[2023-03-20 08:17:55] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 1 ms to minimize.
[2023-03-20 08:17:56] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 0 ms to minimize.
[2023-03-20 08:17:56] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 0 ms to minimize.
[2023-03-20 08:17:56] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 1 ms to minimize.
[2023-03-20 08:17:56] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 1 ms to minimize.
[2023-03-20 08:17:56] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2023-03-20 08:17:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1499 ms
[2023-03-20 08:17:57] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 1 ms to minimize.
[2023-03-20 08:17:57] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 1 ms to minimize.
[2023-03-20 08:17:57] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 1 ms to minimize.
[2023-03-20 08:17:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 852 ms
[2023-03-20 08:17:58] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 1 ms to minimize.
[2023-03-20 08:17:58] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 0 ms to minimize.
[2023-03-20 08:17:58] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2023-03-20 08:17:59] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 1 ms to minimize.
[2023-03-20 08:17:59] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 0 ms to minimize.
[2023-03-20 08:17:59] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 0 ms to minimize.
[2023-03-20 08:17:59] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 1 ms to minimize.
[2023-03-20 08:18:00] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 1 ms to minimize.
[2023-03-20 08:18:00] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 1 ms to minimize.
[2023-03-20 08:18:00] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 1 ms to minimize.
[2023-03-20 08:18:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2812 ms
[2023-03-20 08:18:01] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 1 ms to minimize.
[2023-03-20 08:18:01] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 0 ms to minimize.
[2023-03-20 08:18:01] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 2 ms to minimize.
[2023-03-20 08:18:01] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 1 ms to minimize.
[2023-03-20 08:18:02] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 2 ms to minimize.
[2023-03-20 08:18:02] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 1 ms to minimize.
[2023-03-20 08:18:02] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2023-03-20 08:18:03] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 1 ms to minimize.
[2023-03-20 08:18:03] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 1 ms to minimize.
[2023-03-20 08:18:03] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 0 ms to minimize.
[2023-03-20 08:18:03] [INFO ] Deduced a trap composed of 76 places in 206 ms of which 2 ms to minimize.
[2023-03-20 08:18:04] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 1 ms to minimize.
[2023-03-20 08:18:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3333 ms
[2023-03-20 08:18:04] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:18:04] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-20 08:18:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 387 ms
[2023-03-20 08:18:04] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 1 ms to minimize.
[2023-03-20 08:18:04] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:18:05] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 0 ms to minimize.
[2023-03-20 08:18:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 597 ms
[2023-03-20 08:18:05] [INFO ] After 14352ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-20 08:18:06] [INFO ] After 15598ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 814 ms.
Support contains 16 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1330 transition count 1369
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1169 transition count 1369
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1169 transition count 1169
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 969 transition count 1169
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 726 place count 965 transition count 1165
Iterating global reduction 2 with 4 rules applied. Total rules applied 730 place count 965 transition count 1165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 730 place count 965 transition count 1163
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 734 place count 963 transition count 1163
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1520 place count 570 transition count 770
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 1598 place count 570 transition count 770
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1599 place count 569 transition count 769
Applied a total of 1599 rules in 305 ms. Remains 569 /1330 variables (removed 761) and now considering 769/1530 (removed 761) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 569/1330 places, 769/1530 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 769 rows 569 cols
[2023-03-20 08:18:07] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 08:18:07] [INFO ] [Real]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-20 08:18:07] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:18:07] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-20 08:18:08] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:18:08] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 08:18:08] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 769/769 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 562 transition count 762
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 562 transition count 762
Applied a total of 17 rules in 92 ms. Remains 562 /569 variables (removed 7) and now considering 762/769 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 562/569 places, 762/769 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished Best-First random walk after 3266 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=362 )
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 323 stabilizing places and 323 stable transitions
FORMULA ShieldRVs-PT-040B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&X(F(p2))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1322 transition count 1522
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1322 transition count 1522
Applied a total of 16 rules in 70 ms. Remains 1322 /1330 variables (removed 8) and now considering 1522/1530 (removed 8) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2023-03-20 08:18:08] [INFO ] Computed 161 place invariants in 20 ms
[2023-03-20 08:18:09] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-20 08:18:09] [INFO ] Invariant cache hit.
[2023-03-20 08:18:10] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2023-03-20 08:18:10] [INFO ] Invariant cache hit.
[2023-03-20 08:18:11] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1330 places, 1522/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2466 ms. Remains : 1322/1330 places, 1522/1530 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s28 1), p0:(NEQ s1127 1), p2:(AND (EQ s40 1) (EQ s60 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9162 steps with 7 reset in 92 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-00 finished in 2878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1329 transition count 1368
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1168 transition count 1368
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1168 transition count 1168
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 968 transition count 1168
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 730 place count 960 transition count 1160
Iterating global reduction 2 with 8 rules applied. Total rules applied 738 place count 960 transition count 1160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 738 place count 960 transition count 1158
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 742 place count 958 transition count 1158
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1532 place count 563 transition count 763
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1534 place count 561 transition count 761
Applied a total of 1534 rules in 193 ms. Remains 561 /1330 variables (removed 769) and now considering 761/1530 (removed 769) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-20 08:18:11] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-20 08:18:12] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-20 08:18:12] [INFO ] Invariant cache hit.
[2023-03-20 08:18:12] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2023-03-20 08:18:12] [INFO ] Redundant transitions in 138 ms returned [760]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2023-03-20 08:18:12] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-20 08:18:13] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1330 places, 760/1530 transitions.
Applied a total of 0 rules in 16 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1588 ms. Remains : 561/1330 places, 760/1530 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 0)], 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 187 reset in 577 ms.
Product exploration explored 100000 steps with 186 reset in 666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 424 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=106 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 20 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2023-03-20 08:18:14] [INFO ] Invariant cache hit.
[2023-03-20 08:18:14] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-20 08:18:14] [INFO ] Invariant cache hit.
[2023-03-20 08:18:15] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-20 08:18:15] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-20 08:18:15] [INFO ] Invariant cache hit.
[2023-03-20 08:18:15] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1168 ms. Remains : 561/561 places, 760/760 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 482 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=120 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 187 reset in 410 ms.
Product exploration explored 100000 steps with 186 reset in 507 ms.
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 17 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2023-03-20 08:18:17] [INFO ] Invariant cache hit.
[2023-03-20 08:18:17] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-20 08:18:17] [INFO ] Invariant cache hit.
[2023-03-20 08:18:17] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2023-03-20 08:18:18] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-20 08:18:18] [INFO ] Invariant cache hit.
[2023-03-20 08:18:18] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1278 ms. Remains : 561/561 places, 760/760 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-01 finished in 7001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U (p2||G(p1)))))))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1323 transition count 1523
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1323 transition count 1523
Applied a total of 14 rules in 68 ms. Remains 1323 /1330 variables (removed 7) and now considering 1523/1530 (removed 7) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2023-03-20 08:18:18] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 08:18:18] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-20 08:18:18] [INFO ] Invariant cache hit.
[2023-03-20 08:18:20] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2023-03-20 08:18:20] [INFO ] Invariant cache hit.
[2023-03-20 08:18:20] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 1523/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2303 ms. Remains : 1323/1330 places, 1523/1530 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NEQ s38 1) (NEQ s440 1)), p1:(NEQ s440 1), p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1255 steps with 0 reset in 7 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-03 finished in 2461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G((p1&&F((!p2 U (p3||G(!p2))))))))))'
Support contains 6 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1322 transition count 1522
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1322 transition count 1522
Applied a total of 16 rules in 75 ms. Remains 1322 /1330 variables (removed 8) and now considering 1522/1530 (removed 8) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2023-03-20 08:18:21] [INFO ] Computed 161 place invariants in 12 ms
[2023-03-20 08:18:21] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-20 08:18:21] [INFO ] Invariant cache hit.
[2023-03-20 08:18:22] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2023-03-20 08:18:22] [INFO ] Invariant cache hit.
[2023-03-20 08:18:23] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1330 places, 1522/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2301 ms. Remains : 1322/1330 places, 1522/1530 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p3) p2), (OR (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s563 1), p1:(NEQ s1214 1), p3:(AND (NEQ s1189 1) (NOT (AND (EQ s145 1) (EQ s179 1) (EQ s200 1)))), p2:(AND (EQ s145 1) (EQ s179 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64524 steps with 37 reset in 301 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-04 finished in 2754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1323 transition count 1523
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1323 transition count 1523
Applied a total of 14 rules in 72 ms. Remains 1323 /1330 variables (removed 7) and now considering 1523/1530 (removed 7) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2023-03-20 08:18:23] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-20 08:18:24] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-20 08:18:24] [INFO ] Invariant cache hit.
[2023-03-20 08:18:25] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
[2023-03-20 08:18:25] [INFO ] Invariant cache hit.
[2023-03-20 08:18:26] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 1523/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2384 ms. Remains : 1323/1330 places, 1523/1530 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s135 1) (EQ s156 1)), p1:(EQ s584 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 58 reset in 434 ms.
Product exploration explored 100000 steps with 58 reset in 490 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 297 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 171635 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171635 steps, saw 124409 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 08:18:31] [INFO ] Invariant cache hit.
[2023-03-20 08:18:31] [INFO ] [Real]Absence check using 161 positive place invariants in 39 ms returned sat
[2023-03-20 08:18:31] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:18:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 50 ms returned sat
[2023-03-20 08:18:32] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 08:18:33] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 1 ms to minimize.
[2023-03-20 08:18:33] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 1 ms to minimize.
[2023-03-20 08:18:33] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 1 ms to minimize.
[2023-03-20 08:18:34] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 1 ms to minimize.
[2023-03-20 08:18:34] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 1 ms to minimize.
[2023-03-20 08:18:34] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 1 ms to minimize.
[2023-03-20 08:18:34] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 1 ms to minimize.
[2023-03-20 08:18:35] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 1 ms to minimize.
[2023-03-20 08:18:35] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 0 ms to minimize.
[2023-03-20 08:18:35] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 0 ms to minimize.
[2023-03-20 08:18:36] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 1 ms to minimize.
[2023-03-20 08:18:36] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 1 ms to minimize.
[2023-03-20 08:18:36] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 1 ms to minimize.
[2023-03-20 08:18:36] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2023-03-20 08:18:37] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 1 ms to minimize.
[2023-03-20 08:18:37] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 1 ms to minimize.
[2023-03-20 08:18:37] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-20 08:18:37] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2023-03-20 08:18:37] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2023-03-20 08:18:38] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2023-03-20 08:18:38] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-20 08:18:38] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2023-03-20 08:18:38] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 1 ms to minimize.
[2023-03-20 08:18:38] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 1 ms to minimize.
[2023-03-20 08:18:39] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:18:39] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:18:39] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 1 ms to minimize.
[2023-03-20 08:18:39] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 0 ms to minimize.
[2023-03-20 08:18:40] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2023-03-20 08:18:40] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 0 ms to minimize.
[2023-03-20 08:18:40] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 0 ms to minimize.
[2023-03-20 08:18:40] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:18:41] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2023-03-20 08:18:41] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:18:41] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 1 ms to minimize.
[2023-03-20 08:18:41] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 0 ms to minimize.
[2023-03-20 08:18:41] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 1 ms to minimize.
[2023-03-20 08:18:42] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:18:42] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:18:42] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2023-03-20 08:18:42] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2023-03-20 08:18:42] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 9858 ms
[2023-03-20 08:18:42] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 1 ms to minimize.
[2023-03-20 08:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-20 08:18:43] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-20 08:18:43] [INFO ] After 11204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-20 08:18:43] [INFO ] After 11633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 197 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 207 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 563/1323 places, 763/1523 transitions.
Finished random walk after 3752 steps, including 7 resets, run visited all 3 properties in 93 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 41 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2023-03-20 08:18:44] [INFO ] Invariant cache hit.
[2023-03-20 08:18:45] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-20 08:18:45] [INFO ] Invariant cache hit.
[2023-03-20 08:18:46] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2023-03-20 08:18:46] [INFO ] Invariant cache hit.
[2023-03-20 08:18:46] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2270 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 191219 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191219 steps, saw 128267 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 08:18:50] [INFO ] Invariant cache hit.
[2023-03-20 08:18:50] [INFO ] [Real]Absence check using 161 positive place invariants in 49 ms returned sat
[2023-03-20 08:18:50] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:18:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 51 ms returned sat
[2023-03-20 08:18:51] [INFO ] After 963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 08:18:52] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 1 ms to minimize.
[2023-03-20 08:18:52] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2023-03-20 08:18:53] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2023-03-20 08:18:53] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 1 ms to minimize.
[2023-03-20 08:18:53] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 1 ms to minimize.
[2023-03-20 08:18:54] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 1 ms to minimize.
[2023-03-20 08:18:54] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 1 ms to minimize.
[2023-03-20 08:18:54] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2023-03-20 08:18:55] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 2 ms to minimize.
[2023-03-20 08:18:55] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 1 ms to minimize.
[2023-03-20 08:18:55] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 1 ms to minimize.
[2023-03-20 08:18:56] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 1 ms to minimize.
[2023-03-20 08:18:56] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 1 ms to minimize.
[2023-03-20 08:18:56] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 0 ms to minimize.
[2023-03-20 08:18:57] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 1 ms to minimize.
[2023-03-20 08:18:57] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 1 ms to minimize.
[2023-03-20 08:18:57] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 1 ms to minimize.
[2023-03-20 08:18:58] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 1 ms to minimize.
[2023-03-20 08:18:58] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 0 ms to minimize.
[2023-03-20 08:18:58] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 0 ms to minimize.
[2023-03-20 08:18:59] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 1 ms to minimize.
[2023-03-20 08:18:59] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 0 ms to minimize.
[2023-03-20 08:18:59] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 0 ms to minimize.
[2023-03-20 08:19:00] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 1 ms to minimize.
[2023-03-20 08:19:00] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 0 ms to minimize.
[2023-03-20 08:19:00] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 1 ms to minimize.
[2023-03-20 08:19:00] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 0 ms to minimize.
[2023-03-20 08:19:01] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 1 ms to minimize.
[2023-03-20 08:19:01] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 0 ms to minimize.
[2023-03-20 08:19:01] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 1 ms to minimize.
[2023-03-20 08:19:01] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 1 ms to minimize.
[2023-03-20 08:19:02] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-20 08:19:02] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 1 ms to minimize.
[2023-03-20 08:19:02] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 0 ms to minimize.
[2023-03-20 08:19:02] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2023-03-20 08:19:03] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-20 08:19:03] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
[2023-03-20 08:19:03] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 1 ms to minimize.
[2023-03-20 08:19:03] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 0 ms to minimize.
[2023-03-20 08:19:04] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 0 ms to minimize.
[2023-03-20 08:19:04] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2023-03-20 08:19:04] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 0 ms to minimize.
[2023-03-20 08:19:04] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-20 08:19:05] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 0 ms to minimize.
[2023-03-20 08:19:05] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 1 ms to minimize.
[2023-03-20 08:19:05] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 0 ms to minimize.
[2023-03-20 08:19:05] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 0 ms to minimize.
[2023-03-20 08:19:06] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 0 ms to minimize.
[2023-03-20 08:19:06] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 0 ms to minimize.
[2023-03-20 08:19:06] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 5 ms to minimize.
[2023-03-20 08:19:07] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 1 ms to minimize.
[2023-03-20 08:19:07] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 1 ms to minimize.
[2023-03-20 08:19:07] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 1 ms to minimize.
[2023-03-20 08:19:07] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 1 ms to minimize.
[2023-03-20 08:19:08] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 0 ms to minimize.
[2023-03-20 08:19:08] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 1 ms to minimize.
[2023-03-20 08:19:08] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 0 ms to minimize.
[2023-03-20 08:19:08] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:19:08] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 1 ms to minimize.
[2023-03-20 08:19:09] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:19:09] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 17205 ms
[2023-03-20 08:19:09] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-20 08:19:09] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-20 08:19:09] [INFO ] After 18872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-20 08:19:10] [INFO ] After 19384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 193 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 167 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 563/1323 places, 763/1523 transitions.
Finished random walk after 905 steps, including 1 resets, run visited all 3 properties in 21 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 58 reset in 527 ms.
Product exploration explored 100000 steps with 59 reset in 555 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 45 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2023-03-20 08:19:12] [INFO ] Invariant cache hit.
[2023-03-20 08:19:12] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-20 08:19:12] [INFO ] Invariant cache hit.
[2023-03-20 08:19:14] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
[2023-03-20 08:19:14] [INFO ] Invariant cache hit.
[2023-03-20 08:19:14] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2323 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-05 finished in 51083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1329 transition count 1369
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1169 transition count 1369
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 320 place count 1169 transition count 1170
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 718 place count 970 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 726 place count 962 transition count 1162
Iterating global reduction 2 with 8 rules applied. Total rules applied 734 place count 962 transition count 1162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 734 place count 962 transition count 1160
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 738 place count 960 transition count 1160
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1528 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1530 place count 563 transition count 763
Applied a total of 1530 rules in 147 ms. Remains 563 /1330 variables (removed 767) and now considering 763/1530 (removed 767) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 08:19:14] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 08:19:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-20 08:19:15] [INFO ] Invariant cache hit.
[2023-03-20 08:19:15] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-20 08:19:15] [INFO ] Redundant transitions in 118 ms returned [762]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 762 rows 563 cols
[2023-03-20 08:19:15] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 08:19:16] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/1330 places, 762/1530 transitions.
Applied a total of 0 rules in 14 ms. Remains 563 /563 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1298 ms. Remains : 563/1330 places, 762/1530 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s493 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 550 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-06 finished in 1347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(p1)&&F(!p2)))))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1322 transition count 1522
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1322 transition count 1522
Applied a total of 16 rules in 67 ms. Remains 1322 /1330 variables (removed 8) and now considering 1522/1530 (removed 8) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2023-03-20 08:19:16] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-20 08:19:16] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-20 08:19:16] [INFO ] Invariant cache hit.
[2023-03-20 08:19:17] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
[2023-03-20 08:19:17] [INFO ] Invariant cache hit.
[2023-03-20 08:19:18] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1330 places, 1522/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2335 ms. Remains : 1322/1330 places, 1522/1530 transitions.
Stuttering acceptance computed with spot in 167 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p2 p0), (NOT p1), p2]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s981 1) (EQ s984 1) (EQ s991 1)), p1:(NEQ s1132 1), p2:(AND (EQ s926 1) (EQ s935 1) (EQ s956 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1009 ms.
Product exploration explored 100000 steps with 50000 reset in 1153 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1322 stabilizing places and 319/1522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040B-LTLFireability-08 finished in 4934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((G(p2)&&p1)))))'
Support contains 8 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 1329 transition count 1371
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 1 with 158 rules applied. Total rules applied 316 place count 1171 transition count 1371
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 316 place count 1171 transition count 1171
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 716 place count 971 transition count 1171
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 722 place count 965 transition count 1165
Iterating global reduction 2 with 6 rules applied. Total rules applied 728 place count 965 transition count 1165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 728 place count 965 transition count 1164
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 730 place count 964 transition count 1164
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1520 place count 569 transition count 769
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1522 place count 567 transition count 767
Applied a total of 1522 rules in 159 ms. Remains 567 /1330 variables (removed 763) and now considering 767/1530 (removed 763) transitions.
// Phase 1: matrix 767 rows 567 cols
[2023-03-20 08:19:21] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 08:19:21] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-20 08:19:21] [INFO ] Invariant cache hit.
[2023-03-20 08:19:22] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2023-03-20 08:19:22] [INFO ] Redundant transitions in 117 ms returned [766]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 766 rows 567 cols
[2023-03-20 08:19:22] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 08:19:22] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 567/1330 places, 766/1530 transitions.
Applied a total of 0 rules in 15 ms. Remains 567 /567 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1428 ms. Remains : 567/1330 places, 766/1530 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s272 1), p1:(AND (EQ s496 1) (EQ s513 1) (EQ s525 1)), p2:(AND (EQ s500 1) (EQ s502 1) (EQ s506 1) (EQ s209 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 509 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-09 finished in 1560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1324 transition count 1524
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1324 transition count 1524
Applied a total of 12 rules in 84 ms. Remains 1324 /1330 variables (removed 6) and now considering 1524/1530 (removed 6) transitions.
// Phase 1: matrix 1524 rows 1324 cols
[2023-03-20 08:19:22] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-20 08:19:23] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-20 08:19:23] [INFO ] Invariant cache hit.
[2023-03-20 08:19:24] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2023-03-20 08:19:24] [INFO ] Invariant cache hit.
[2023-03-20 08:19:24] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 1524/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2214 ms. Remains : 1324/1330 places, 1524/1530 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s536 1), p0:(EQ s952 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4158 steps with 2 reset in 19 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-11 finished in 2321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||F(p2))))))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1324 transition count 1524
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1324 transition count 1524
Applied a total of 12 rules in 69 ms. Remains 1324 /1330 variables (removed 6) and now considering 1524/1530 (removed 6) transitions.
// Phase 1: matrix 1524 rows 1324 cols
[2023-03-20 08:19:25] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-20 08:19:25] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-20 08:19:25] [INFO ] Invariant cache hit.
[2023-03-20 08:19:26] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2023-03-20 08:19:26] [INFO ] Invariant cache hit.
[2023-03-20 08:19:27] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 1524/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2082 ms. Remains : 1324/1330 places, 1524/1530 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s242 1), p1:(AND (EQ s1216 1) (EQ s1225 1) (EQ s1246 1)), p2:(EQ s967 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1631 steps with 0 reset in 8 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-12 finished in 2189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1329 transition count 1370
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1170 transition count 1370
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 318 place count 1170 transition count 1170
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 718 place count 970 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 726 place count 962 transition count 1162
Iterating global reduction 2 with 8 rules applied. Total rules applied 734 place count 962 transition count 1162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 734 place count 962 transition count 1160
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 738 place count 960 transition count 1160
Performed 394 Post agglomeration using F-continuation condition.Transition count delta: 394
Deduced a syphon composed of 394 places in 1 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1526 place count 566 transition count 766
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1528 place count 564 transition count 764
Applied a total of 1528 rules in 128 ms. Remains 564 /1330 variables (removed 766) and now considering 764/1530 (removed 766) transitions.
// Phase 1: matrix 764 rows 564 cols
[2023-03-20 08:19:27] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 08:19:27] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-20 08:19:27] [INFO ] Invariant cache hit.
[2023-03-20 08:19:27] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-20 08:19:28] [INFO ] Redundant transitions in 98 ms returned [763]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 763 rows 564 cols
[2023-03-20 08:19:28] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-20 08:19:28] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1330 places, 763/1530 transitions.
Applied a total of 0 rules in 13 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1181 ms. Remains : 564/1330 places, 763/1530 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s129 1) (EQ s147 1) (EQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 491 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-15 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
[2023-03-20 08:19:28] [INFO ] Flatten gal took : 90 ms
[2023-03-20 08:19:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 08:19:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 1530 transitions and 5214 arcs took 12 ms.
Total runtime 105717 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1661/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1661/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-040B-LTLFireability-01
Could not compute solution for formula : ShieldRVs-PT-040B-LTLFireability-05

BK_STOP 1679300370235

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5632995683f4]
1: pnml2lts-mc(+0xa2496) [0x563299568496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ffba145c140]
3: pnml2lts-mc(+0x405be5) [0x5632998cbbe5]
4: pnml2lts-mc(+0x16b3f9) [0x5632996313f9]
5: pnml2lts-mc(+0x164ac4) [0x56329962aac4]
6: pnml2lts-mc(+0x272e0a) [0x563299738e0a]
7: pnml2lts-mc(+0xb61f0) [0x56329957c1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ffba12af4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ffba12af67a]
10: pnml2lts-mc(+0xa1581) [0x563299567581]
11: pnml2lts-mc(+0xa1910) [0x563299567910]
12: pnml2lts-mc(+0xa32a2) [0x5632995692a2]
13: pnml2lts-mc(+0xa50f4) [0x56329956b0f4]
14: pnml2lts-mc(+0xa516b) [0x56329956b16b]
15: pnml2lts-mc(+0x3f34b3) [0x5632998b94b3]
16: pnml2lts-mc(+0x7c63d) [0x56329954263d]
17: pnml2lts-mc(+0x67d86) [0x56329952dd86]
18: pnml2lts-mc(+0x60a8a) [0x563299526a8a]
19: pnml2lts-mc(+0x5eb15) [0x563299524b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ffba1297d0a]
21: pnml2lts-mc(+0x6075e) [0x56329952675e]
ltl formula name ShieldRVs-PT-040B-LTLFireability-05
ltl formula formula --ltl=/tmp/1661/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1330 places, 1530 transitions and 5214 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1661/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1661/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1661/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.060 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1661/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-040B, 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 r425-tajo-167905977800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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