fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903715100324
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldIIPt-PT-050A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5490.604 371531.00 453298.00 55.20 FFT??FFFFFFTFF?F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 18:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 265K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679273541536

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:52:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:52:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:52:24] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-20 00:52:24] [INFO ] Transformed 953 places.
[2023-03-20 00:52:24] [INFO ] Transformed 703 transitions.
[2023-03-20 00:52:24] [INFO ] Found NUPN structural information;
[2023-03-20 00:52:24] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 129 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-20 00:52:24] [INFO ] Computed 451 place invariants in 17 ms
[2023-03-20 00:52:25] [INFO ] Implicit Places using invariants in 962 ms returned []
[2023-03-20 00:52:25] [INFO ] Invariant cache hit.
[2023-03-20 00:52:26] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2023-03-20 00:52:26] [INFO ] Invariant cache hit.
[2023-03-20 00:52:27] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3115 ms. Remains : 953/953 places, 702/702 transitions.
Support contains 57 out of 953 places after structural reductions.
[2023-03-20 00:52:27] [INFO ] Flatten gal took : 142 ms
[2023-03-20 00:52:27] [INFO ] Flatten gal took : 103 ms
[2023-03-20 00:52:28] [INFO ] Input system was already deterministic with 702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 33) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-20 00:52:28] [INFO ] Invariant cache hit.
[2023-03-20 00:52:29] [INFO ] [Real]Absence check using 451 positive place invariants in 159 ms returned sat
[2023-03-20 00:52:34] [INFO ] After 5150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-20 00:52:35] [INFO ] [Nat]Absence check using 451 positive place invariants in 112 ms returned sat
[2023-03-20 00:52:39] [INFO ] After 3201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-20 00:52:42] [INFO ] After 6908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 2489 ms.
[2023-03-20 00:52:45] [INFO ] After 11298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 2 properties in 4847 ms.
Support contains 46 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 0 with 89 rules applied. Total rules applied 93 place count 951 transition count 700
Applied a total of 93 rules in 206 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 951/953 places, 700/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 155587 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1}
Probabilistic random walk after 155587 steps, saw 152240 distinct states, run finished after 3015 ms. (steps per millisecond=51 ) properties seen :23
Running SMT prover for 1 properties.
// Phase 1: matrix 700 rows 951 cols
[2023-03-20 00:52:54] [INFO ] Computed 451 place invariants in 11 ms
[2023-03-20 00:52:54] [INFO ] [Real]Absence check using 451 positive place invariants in 80 ms returned sat
[2023-03-20 00:52:55] [INFO ] After 940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:52:55] [INFO ] [Nat]Absence check using 451 positive place invariants in 81 ms returned sat
[2023-03-20 00:52:55] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:52:55] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 00:52:56] [INFO ] After 201ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:52:56] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-20 00:52:56] [INFO ] After 1170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 70 ms.
Support contains 3 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 951 transition count 700
Applied a total of 11 rules in 125 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 951/951 places, 700/700 transitions.
Finished random walk after 2927 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=133 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&F(!p1))))'
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 93 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-20 00:52:57] [INFO ] Computed 451 place invariants in 9 ms
[2023-03-20 00:52:57] [INFO ] Implicit Places using invariants in 634 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 636 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 48 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-20 00:52:58] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-20 00:52:58] [INFO ] Implicit Places using invariants in 789 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 804 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 58 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:52:58] [INFO ] Computed 448 place invariants in 5 ms
[2023-03-20 00:52:59] [INFO ] Implicit Places using invariants in 809 ms returned []
[2023-03-20 00:52:59] [INFO ] Invariant cache hit.
[2023-03-20 00:53:01] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3831 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 485 ms :[p1, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s612 1) (EQ s625 1)), p0:(AND (EQ s278 1) (EQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 970 ms.
Stack based approach found an accepted trace after 188 steps with 0 reset with depth 189 and stack size 189 in 2 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-00 finished in 5417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||F(G(p2)))))))'
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 20 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-20 00:53:02] [INFO ] Computed 451 place invariants in 9 ms
[2023-03-20 00:53:03] [INFO ] Implicit Places using invariants in 780 ms returned []
[2023-03-20 00:53:03] [INFO ] Invariant cache hit.
[2023-03-20 00:53:04] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
[2023-03-20 00:53:04] [INFO ] Invariant cache hit.
[2023-03-20 00:53:05] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2548 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s147 1) (EQ s162 1)), p1:(EQ s322 1), p2:(OR (EQ s30 0) (EQ s34 0) (EQ s40 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 825 ms.
Product exploration explored 100000 steps with 0 reset in 1043 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44362 steps, run visited all 1 properties in 404 ms. (steps per millisecond=109 )
Probabilistic random walk after 44362 steps, saw 43567 distinct states, run finished after 405 ms. (steps per millisecond=109 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 247 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 69 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Support contains 3 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 66 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-20 00:53:08] [INFO ] Computed 451 place invariants in 3 ms
[2023-03-20 00:53:09] [INFO ] Implicit Places using invariants in 937 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 949 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 72 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-20 00:53:09] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-20 00:53:10] [INFO ] Implicit Places using invariants in 673 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 674 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 32 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:53:10] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:53:10] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-20 00:53:10] [INFO ] Invariant cache hit.
[2023-03-20 00:53:12] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3684 ms. Remains : 946/953 places, 698/702 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 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 34 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44396 steps, run visited all 1 properties in 402 ms. (steps per millisecond=110 )
Probabilistic random walk after 44396 steps, saw 43561 distinct states, run finished after 403 ms. (steps per millisecond=110 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 172 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 40 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2)]
Product exploration explored 100000 steps with 0 reset in 674 ms.
Product exploration explored 100000 steps with 0 reset in 900 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-20 00:53:14] [INFO ] Invariant cache hit.
[2023-03-20 00:53:15] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-20 00:53:15] [INFO ] Invariant cache hit.
[2023-03-20 00:53:16] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
[2023-03-20 00:53:16] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-20 00:53:16] [INFO ] Invariant cache hit.
[2023-03-20 00:53:17] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2367 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-01 finished in 14872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||G(p2)))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-20 00:53:17] [INFO ] Computed 451 place invariants in 3 ms
[2023-03-20 00:53:18] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-20 00:53:18] [INFO ] Invariant cache hit.
[2023-03-20 00:53:19] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1675 ms to find 0 implicit places.
[2023-03-20 00:53:19] [INFO ] Invariant cache hit.
[2023-03-20 00:53:19] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2395 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(EQ s191 0), p0:(OR (EQ s746 0) (EQ s757 0)), p2:(OR (EQ s746 0) (EQ s757 0))], 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 757 ms.
Product exploration explored 100000 steps with 0 reset in 932 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1983 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 00:53:25] [INFO ] Invariant cache hit.
[2023-03-20 00:53:25] [INFO ] [Real]Absence check using 451 positive place invariants in 99 ms returned sat
[2023-03-20 00:53:26] [INFO ] After 1020ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-20 00:53:26] [INFO ] [Nat]Absence check using 451 positive place invariants in 142 ms returned sat
[2023-03-20 00:53:27] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-20 00:53:27] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-20 00:53:27] [INFO ] After 1584ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 3862 steps, including 2 resets, run visited all 3 properties in 63 ms. (steps per millisecond=61 )
Parikh walk visited 3 properties in 195 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 35 factoid took 2233 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 16 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 00:53:30] [INFO ] Invariant cache hit.
[2023-03-20 00:53:31] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-20 00:53:31] [INFO ] Invariant cache hit.
[2023-03-20 00:53:32] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2023-03-20 00:53:32] [INFO ] Invariant cache hit.
[2023-03-20 00:53:32] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2441 ms. Remains : 953/953 places, 702/702 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 442 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:53:33] [INFO ] Invariant cache hit.
[2023-03-20 00:53:33] [INFO ] [Real]Absence check using 451 positive place invariants in 94 ms returned sat
[2023-03-20 00:53:34] [INFO ] After 842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:53:34] [INFO ] [Nat]Absence check using 451 positive place invariants in 67 ms returned sat
[2023-03-20 00:53:35] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:53:35] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 00:53:35] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 104 place count 951 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 950 transition count 699
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 107 place count 948 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 107 place count 948 transition count 698
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 947 transition count 698
Applied a total of 109 rules in 93 ms. Remains 947 /953 variables (removed 6) and now considering 698/702 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 947/953 places, 698/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25977 steps, run visited all 1 properties in 252 ms. (steps per millisecond=103 )
Probabilistic random walk after 25977 steps, saw 25030 distinct states, run finished after 253 ms. (steps per millisecond=102 ) properties seen :1
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 643 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 714 ms.
Product exploration explored 100000 steps with 0 reset in 854 ms.
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 00:53:38] [INFO ] Invariant cache hit.
[2023-03-20 00:53:39] [INFO ] Implicit Places using invariants in 807 ms returned []
[2023-03-20 00:53:39] [INFO ] Invariant cache hit.
[2023-03-20 00:53:40] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
[2023-03-20 00:53:40] [INFO ] Invariant cache hit.
[2023-03-20 00:53:41] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2502 ms. Remains : 953/953 places, 702/702 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-03 finished in 23648 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)||G(p1))))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 53 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-20 00:53:41] [INFO ] Computed 451 place invariants in 2 ms
[2023-03-20 00:53:41] [INFO ] Implicit Places using invariants in 611 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 614 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 22 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-20 00:53:41] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-20 00:53:42] [INFO ] Implicit Places using invariants in 712 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 714 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 37 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:53:42] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:53:43] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-20 00:53:43] [INFO ] Invariant cache hit.
[2023-03-20 00:53:44] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3643 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s723 0), p1:(OR (EQ s443 0) (EQ s452 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 668 ms.
Product exploration explored 100000 steps with 0 reset in 885 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 372 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 00:53:47] [INFO ] Invariant cache hit.
[2023-03-20 00:53:47] [INFO ] [Real]Absence check using 448 positive place invariants in 226 ms returned sat
[2023-03-20 00:53:48] [INFO ] After 1095ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:53:48] [INFO ] [Nat]Absence check using 448 positive place invariants in 147 ms returned sat
[2023-03-20 00:53:49] [INFO ] After 806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:53:49] [INFO ] After 1010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-20 00:53:49] [INFO ] After 1535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 341 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 946 transition count 698
Applied a total of 99 rules in 50 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 263252 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{0=1}
Probabilistic random walk after 263252 steps, saw 254570 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:53:53] [INFO ] Computed 448 place invariants in 12 ms
[2023-03-20 00:53:53] [INFO ] [Real]Absence check using 448 positive place invariants in 133 ms returned sat
[2023-03-20 00:53:54] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:53:54] [INFO ] [Nat]Absence check using 448 positive place invariants in 92 ms returned sat
[2023-03-20 00:53:55] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:53:55] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 00:53:55] [INFO ] After 262ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:53:55] [INFO ] After 388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-20 00:53:55] [INFO ] After 1498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 20 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 301275 steps, run timeout after 3018 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 301275 steps, saw 289985 distinct states, run finished after 3023 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:53:58] [INFO ] Invariant cache hit.
[2023-03-20 00:53:59] [INFO ] [Real]Absence check using 448 positive place invariants in 449 ms returned sat
[2023-03-20 00:54:00] [INFO ] After 1366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:54:00] [INFO ] [Nat]Absence check using 448 positive place invariants in 65 ms returned sat
[2023-03-20 00:54:01] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 00:54:01] [INFO ] After 236ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:01] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-20 00:54:01] [INFO ] After 1285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 19 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-20 00:54:01] [INFO ] Invariant cache hit.
[2023-03-20 00:54:02] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-20 00:54:02] [INFO ] Invariant cache hit.
[2023-03-20 00:54:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 00:54:04] [INFO ] Implicit Places using invariants and state equation in 2710 ms returned []
Implicit Place search using SMT with State Equation took 3264 ms to find 0 implicit places.
[2023-03-20 00:54:04] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 00:54:04] [INFO ] Invariant cache hit.
[2023-03-20 00:54:05] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3857 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 946 transition count 698
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 946 transition count 648
Applied a total of 100 rules in 46 ms. Remains 946 /946 variables (removed 0) and now considering 648/698 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 648 rows 946 cols
[2023-03-20 00:54:05] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:54:05] [INFO ] [Real]Absence check using 448 positive place invariants in 130 ms returned sat
[2023-03-20 00:54:06] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:54:06] [INFO ] [Nat]Absence check using 448 positive place invariants in 225 ms returned sat
[2023-03-20 00:54:07] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:07] [INFO ] After 841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 00:54:07] [INFO ] After 1327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 462 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:54:08] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:54:09] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-20 00:54:09] [INFO ] Invariant cache hit.
[2023-03-20 00:54:10] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1970 ms to find 0 implicit places.
[2023-03-20 00:54:10] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 00:54:10] [INFO ] Invariant cache hit.
[2023-03-20 00:54:10] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2494 ms. Remains : 946/946 places, 698/698 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 00:54:11] [INFO ] Invariant cache hit.
[2023-03-20 00:54:11] [INFO ] [Real]Absence check using 448 positive place invariants in 183 ms returned sat
[2023-03-20 00:54:12] [INFO ] After 1215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:54:12] [INFO ] [Nat]Absence check using 448 positive place invariants in 54 ms returned sat
[2023-03-20 00:54:13] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:54:13] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-20 00:54:14] [INFO ] After 1331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 174 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 946 transition count 698
Applied a total of 99 rules in 32 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 292320 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{0=1}
Probabilistic random walk after 292320 steps, saw 281897 distinct states, run finished after 3014 ms. (steps per millisecond=96 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:54:17] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-20 00:54:17] [INFO ] [Real]Absence check using 448 positive place invariants in 187 ms returned sat
[2023-03-20 00:54:18] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:54:18] [INFO ] [Nat]Absence check using 448 positive place invariants in 124 ms returned sat
[2023-03-20 00:54:19] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 00:54:19] [INFO ] After 273ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:19] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-20 00:54:19] [INFO ] After 1483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 154 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 36 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322178 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322178 steps, saw 309650 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:54:23] [INFO ] Invariant cache hit.
[2023-03-20 00:54:23] [INFO ] [Real]Absence check using 448 positive place invariants in 201 ms returned sat
[2023-03-20 00:54:23] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:54:24] [INFO ] [Nat]Absence check using 448 positive place invariants in 585 ms returned sat
[2023-03-20 00:54:25] [INFO ] After 1390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 00:54:26] [INFO ] After 280ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:26] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-20 00:54:26] [INFO ] After 2706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 19 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-20 00:54:26] [INFO ] Invariant cache hit.
[2023-03-20 00:54:27] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-20 00:54:27] [INFO ] Invariant cache hit.
[2023-03-20 00:54:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-20 00:54:29] [INFO ] Implicit Places using invariants and state equation in 2512 ms returned []
Implicit Place search using SMT with State Equation took 3254 ms to find 0 implicit places.
[2023-03-20 00:54:29] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-20 00:54:29] [INFO ] Invariant cache hit.
[2023-03-20 00:54:30] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3924 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 946 transition count 698
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 946 transition count 648
Applied a total of 100 rules in 56 ms. Remains 946 /946 variables (removed 0) and now considering 648/698 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 648 rows 946 cols
[2023-03-20 00:54:30] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-20 00:54:30] [INFO ] [Real]Absence check using 448 positive place invariants in 214 ms returned sat
[2023-03-20 00:54:31] [INFO ] After 964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:54:32] [INFO ] [Nat]Absence check using 448 positive place invariants in 119 ms returned sat
[2023-03-20 00:54:32] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:54:32] [INFO ] After 735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 00:54:32] [INFO ] After 1393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 430 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 629 ms.
Product exploration explored 100000 steps with 0 reset in 895 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 16 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:54:35] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-20 00:54:35] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-20 00:54:35] [INFO ] Invariant cache hit.
[2023-03-20 00:54:37] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
[2023-03-20 00:54:37] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 00:54:37] [INFO ] Invariant cache hit.
[2023-03-20 00:54:38] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3021 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-04 finished in 57093 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(p0)||X(F(p1))))'
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-20 00:54:38] [INFO ] Computed 451 place invariants in 2 ms
[2023-03-20 00:54:38] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-20 00:54:38] [INFO ] Invariant cache hit.
[2023-03-20 00:54:40] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2023-03-20 00:54:40] [INFO ] Invariant cache hit.
[2023-03-20 00:54:40] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2705 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s89 1) (EQ s95 1) (EQ s97 1)), p0:(EQ s337 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 638 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-05 finished in 3461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 32 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 00:54:41] [INFO ] Invariant cache hit.
[2023-03-20 00:54:42] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-20 00:54:42] [INFO ] Invariant cache hit.
[2023-03-20 00:54:43] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
[2023-03-20 00:54:43] [INFO ] Invariant cache hit.
[2023-03-20 00:54:43] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2306 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s632 1) (EQ s643 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-06 finished in 2452 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(((X(X(p0)) U p1)||G(p0)))))'
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 10 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 00:54:44] [INFO ] Invariant cache hit.
[2023-03-20 00:54:44] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-20 00:54:44] [INFO ] Invariant cache hit.
[2023-03-20 00:54:45] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2023-03-20 00:54:45] [INFO ] Invariant cache hit.
[2023-03-20 00:54:46] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2272 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s449 1) (EQ s474 1) (EQ s660 1)), p0:(AND (EQ s463 1) (EQ s465 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-07 finished in 2537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 31 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-20 00:54:46] [INFO ] Computed 451 place invariants in 1 ms
[2023-03-20 00:54:47] [INFO ] Implicit Places using invariants in 577 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 578 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 19 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-20 00:54:47] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-20 00:54:47] [INFO ] Implicit Places using invariants in 456 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 457 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 27 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:54:47] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-20 00:54:48] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-20 00:54:48] [INFO ] Invariant cache hit.
[2023-03-20 00:54:49] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3135 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s282 1), p2:(AND (EQ s64 1) (EQ s66 1)), p1:(AND (EQ s897 1) (EQ s910 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 595 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-08 finished in 3952 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(p0) U p1)||X(X(p2))))'
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-20 00:54:50] [INFO ] Computed 451 place invariants in 23 ms
[2023-03-20 00:54:51] [INFO ] Implicit Places using invariants in 780 ms returned []
[2023-03-20 00:54:51] [INFO ] Invariant cache hit.
[2023-03-20 00:54:53] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2680 ms to find 0 implicit places.
[2023-03-20 00:54:53] [INFO ] Invariant cache hit.
[2023-03-20 00:54:53] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3308 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=(NOT p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 2}, { cond=(AND p1 p0), acceptance={} source=7 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=8 dest: 4}, { cond=(NOT p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s430 1) (EQ s455 1)), p0:(EQ s379 1), p2:(AND (EQ s746 1) (EQ s757 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-09 finished in 3720 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) U (F(p2)&&F((p3||X(p4)))&&p1)))'
Support contains 7 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 29 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 00:54:54] [INFO ] Invariant cache hit.
[2023-03-20 00:54:55] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-20 00:54:55] [INFO ] Invariant cache hit.
[2023-03-20 00:54:56] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
[2023-03-20 00:54:56] [INFO ] Invariant cache hit.
[2023-03-20 00:54:57] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2688 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p0), (NOT p2), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s248 1) (EQ s79 1) (EQ s96 1)), p0:(AND (EQ s234 1) (EQ s243 1)), p2:(EQ s248 1), p3:(EQ s875 1), p4:(EQ s892 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 669 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-10 finished in 3619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 10 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 00:54:57] [INFO ] Invariant cache hit.
[2023-03-20 00:54:58] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-20 00:54:58] [INFO ] Invariant cache hit.
[2023-03-20 00:55:00] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2023-03-20 00:55:00] [INFO ] Invariant cache hit.
[2023-03-20 00:55:00] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2606 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (EQ s290 1) (EQ s301 1)) (AND (EQ s711 1) (EQ s722 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 648 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-12 finished in 3380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 10 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 00:55:01] [INFO ] Invariant cache hit.
[2023-03-20 00:55:02] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-20 00:55:02] [INFO ] Invariant cache hit.
[2023-03-20 00:55:03] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2023-03-20 00:55:03] [INFO ] Invariant cache hit.
[2023-03-20 00:55:03] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2399 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s261 1), p0:(AND (EQ s216 1) (EQ s218 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]]
Product exploration explored 100000 steps with 0 reset in 630 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-13 finished in 3227 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((F(p1)||p0))))'
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 30 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-20 00:55:04] [INFO ] Computed 451 place invariants in 3 ms
[2023-03-20 00:55:05] [INFO ] Implicit Places using invariants in 632 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 646 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 24 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-20 00:55:05] [INFO ] Computed 449 place invariants in 1 ms
[2023-03-20 00:55:05] [INFO ] Implicit Places using invariants in 581 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 586 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 31 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:55:05] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-20 00:55:06] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-20 00:55:06] [INFO ] Invariant cache hit.
[2023-03-20 00:55:07] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2959 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s130 0) (EQ s391 0) (EQ s395 0) (EQ s401 0)), p1:(AND (EQ s337 1) (EQ s352 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 660 ms.
Product exploration explored 100000 steps with 0 reset in 778 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Finished probabilistic random walk after 70225 steps, run visited all 2 properties in 762 ms. (steps per millisecond=92 )
Probabilistic random walk after 70225 steps, saw 69212 distinct states, run finished after 763 ms. (steps per millisecond=92 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 39 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-20 00:55:11] [INFO ] Invariant cache hit.
[2023-03-20 00:55:11] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-20 00:55:11] [INFO ] Invariant cache hit.
[2023-03-20 00:55:13] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2023-03-20 00:55:13] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 00:55:13] [INFO ] Invariant cache hit.
[2023-03-20 00:55:13] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2736 ms. Remains : 946/946 places, 698/698 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Finished probabilistic random walk after 70225 steps, run visited all 2 properties in 921 ms. (steps per millisecond=76 )
Probabilistic random walk after 70225 steps, saw 69212 distinct states, run finished after 923 ms. (steps per millisecond=76 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 380 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 684 ms.
Product exploration explored 100000 steps with 0 reset in 967 ms.
Support contains 6 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-20 00:55:17] [INFO ] Invariant cache hit.
[2023-03-20 00:55:18] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-20 00:55:18] [INFO ] Invariant cache hit.
[2023-03-20 00:55:19] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
[2023-03-20 00:55:20] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-20 00:55:20] [INFO ] Invariant cache hit.
[2023-03-20 00:55:20] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2717 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-14 finished in 16036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||X((X(!p0) U p1))))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 10 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-20 00:55:20] [INFO ] Computed 451 place invariants in 2 ms
[2023-03-20 00:55:21] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-20 00:55:21] [INFO ] Invariant cache hit.
[2023-03-20 00:55:22] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
[2023-03-20 00:55:22] [INFO ] Invariant cache hit.
[2023-03-20 00:55:23] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2662 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s556 1) (EQ s567 1)), p0:(EQ s244 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 645 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-15 finished in 3456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||F(G(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||G(p2)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-050A-LTLFireability-03
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 47 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-20 00:55:24] [INFO ] Computed 451 place invariants in 3 ms
[2023-03-20 00:55:25] [INFO ] Implicit Places using invariants in 778 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 792 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 24 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-20 00:55:25] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-20 00:55:25] [INFO ] Implicit Places using invariants in 572 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 585 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 40 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:55:26] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-20 00:55:26] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-20 00:55:26] [INFO ] Invariant cache hit.
[2023-03-20 00:55:28] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3921 ms. Remains : 946/953 places, 698/702 transitions.
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(EQ s191 0), p0:(OR (EQ s746 0) (EQ s757 0)), p2:(OR (EQ s746 0) (EQ s757 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 644 ms.
Product exploration explored 100000 steps with 0 reset in 827 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1967 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 00:55:33] [INFO ] Invariant cache hit.
[2023-03-20 00:55:33] [INFO ] [Real]Absence check using 448 positive place invariants in 78 ms returned sat
[2023-03-20 00:55:34] [INFO ] After 894ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-20 00:55:34] [INFO ] [Nat]Absence check using 448 positive place invariants in 79 ms returned sat
[2023-03-20 00:55:35] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-20 00:55:35] [INFO ] After 852ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-20 00:55:35] [INFO ] After 1457ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 391 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 946 transition count 698
Applied a total of 97 rules in 33 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 271588 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 271588 steps, saw 262649 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:55:39] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-20 00:55:39] [INFO ] [Real]Absence check using 448 positive place invariants in 78 ms returned sat
[2023-03-20 00:55:40] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:55:40] [INFO ] [Nat]Absence check using 448 positive place invariants in 276 ms returned sat
[2023-03-20 00:55:41] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:55:41] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 00:55:41] [INFO ] After 204ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:55:41] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 00:55:41] [INFO ] After 1809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 19 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288094 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 288094 steps, saw 278037 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:55:45] [INFO ] Invariant cache hit.
[2023-03-20 00:55:46] [INFO ] [Real]Absence check using 448 positive place invariants in 572 ms returned sat
[2023-03-20 00:55:46] [INFO ] After 1257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:55:46] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2023-03-20 00:55:47] [INFO ] After 685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:55:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 00:55:47] [INFO ] After 259ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:55:47] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-20 00:55:47] [INFO ] After 1472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 17 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-20 00:55:48] [INFO ] Invariant cache hit.
[2023-03-20 00:55:48] [INFO ] Implicit Places using invariants in 898 ms returned []
[2023-03-20 00:55:48] [INFO ] Invariant cache hit.
[2023-03-20 00:55:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 00:55:51] [INFO ] Implicit Places using invariants and state equation in 2743 ms returned []
Implicit Place search using SMT with State Equation took 3654 ms to find 0 implicit places.
[2023-03-20 00:55:51] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 00:55:51] [INFO ] Invariant cache hit.
[2023-03-20 00:55:52] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4182 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 49 place count 946 transition count 698
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 946 transition count 649
Applied a total of 98 rules in 44 ms. Remains 946 /946 variables (removed 0) and now considering 649/698 (removed 49) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 649 rows 946 cols
[2023-03-20 00:55:52] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-20 00:55:52] [INFO ] [Real]Absence check using 448 positive place invariants in 72 ms returned sat
[2023-03-20 00:55:52] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:55:53] [INFO ] [Nat]Absence check using 448 positive place invariants in 81 ms returned sat
[2023-03-20 00:55:53] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:55:54] [INFO ] After 828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-20 00:55:54] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 p0 p2))), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 35 factoid took 2321 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 33 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-20 00:55:56] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:55:57] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-20 00:55:57] [INFO ] Invariant cache hit.
[2023-03-20 00:55:58] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2023-03-20 00:55:58] [INFO ] Invariant cache hit.
[2023-03-20 00:55:59] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2541 ms. Remains : 946/946 places, 698/698 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 363 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:55:59] [INFO ] Invariant cache hit.
[2023-03-20 00:56:00] [INFO ] [Real]Absence check using 448 positive place invariants in 59 ms returned sat
[2023-03-20 00:56:00] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:56:00] [INFO ] [Nat]Absence check using 448 positive place invariants in 126 ms returned sat
[2023-03-20 00:56:01] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:56:01] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-20 00:56:01] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 946 transition count 698
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 945 transition count 697
Applied a total of 100 rules in 54 ms. Remains 945 /946 variables (removed 1) and now considering 697/698 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 945/946 places, 697/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25960 steps, run visited all 1 properties in 232 ms. (steps per millisecond=111 )
Probabilistic random walk after 25960 steps, saw 25023 distinct states, run finished after 233 ms. (steps per millisecond=111 ) properties seen :1
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 664 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 693 ms.
Product exploration explored 100000 steps with 0 reset in 894 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 24 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-20 00:56:04] [INFO ] Invariant cache hit.
[2023-03-20 00:56:05] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-03-20 00:56:05] [INFO ] Invariant cache hit.
[2023-03-20 00:56:06] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-20 00:56:06] [INFO ] Invariant cache hit.
[2023-03-20 00:56:06] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2326 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-03 finished in 42688 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)||G(p1))))'
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((F(p1)||p0))))'
[2023-03-20 00:56:07] [INFO ] Flatten gal took : 52 ms
[2023-03-20 00:56:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 00:56:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 953 places, 702 transitions and 3004 arcs took 8 ms.
Total runtime 223330 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-050A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA ShieldIIPt-PT-050A-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679273913067

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldIIPt-PT-050A-LTLFireability-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/900 4/32 ShieldIIPt-PT-050A-LTLFireability-14 221538 m, 44307 m/sec, 221701 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/900 7/32 ShieldIIPt-PT-050A-LTLFireability-14 449240 m, 45540 m/sec, 449403 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/900 10/32 ShieldIIPt-PT-050A-LTLFireability-14 678451 m, 45842 m/sec, 678614 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/900 13/32 ShieldIIPt-PT-050A-LTLFireability-14 907604 m, 45830 m/sec, 907770 t fired, .

Time elapsed: 20 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/900 16/32 ShieldIIPt-PT-050A-LTLFireability-14 1139343 m, 46347 m/sec, 1139509 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/900 19/32 ShieldIIPt-PT-050A-LTLFireability-14 1370238 m, 46179 m/sec, 1370404 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/900 22/32 ShieldIIPt-PT-050A-LTLFireability-14 1600248 m, 46002 m/sec, 1600414 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/900 25/32 ShieldIIPt-PT-050A-LTLFireability-14 1823021 m, 44554 m/sec, 1824432 t fired, .

Time elapsed: 40 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/900 28/32 ShieldIIPt-PT-050A-LTLFireability-14 2051658 m, 45727 m/sec, 2053069 t fired, .

Time elapsed: 45 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/900 32/32 ShieldIIPt-PT-050A-LTLFireability-14 2279421 m, 45552 m/sec, 2280832 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for ShieldIIPt-PT-050A-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPt-PT-050A-LTLFireability-03
lola: time limit : 1181 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1181 11/32 ShieldIIPt-PT-050A-LTLFireability-03 858146 m, 171629 m/sec, 1095882 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1181 21/32 ShieldIIPt-PT-050A-LTLFireability-03 1654998 m, 159370 m/sec, 2148409 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1181 30/32 ShieldIIPt-PT-050A-LTLFireability-03 2405280 m, 150056 m/sec, 3170974 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ShieldIIPt-PT-050A-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-050A-LTLFireability-01
lola: time limit : 1762 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldIIPt-PT-050A-LTLFireability-01
lola: result : false
lola: markings : 21559
lola: fired transitions : 21559
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPt-PT-050A-LTLFireability-04
lola: time limit : 3525 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3525 3/32 ShieldIIPt-PT-050A-LTLFireability-04 169091 m, 33818 m/sec, 169399 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3525 6/32 ShieldIIPt-PT-050A-LTLFireability-04 344248 m, 35031 m/sec, 344557 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3525 8/32 ShieldIIPt-PT-050A-LTLFireability-04 521064 m, 35363 m/sec, 521372 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/3525 10/32 ShieldIIPt-PT-050A-LTLFireability-04 690714 m, 33930 m/sec, 691022 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/3525 13/32 ShieldIIPt-PT-050A-LTLFireability-04 869529 m, 35763 m/sec, 869837 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/3525 15/32 ShieldIIPt-PT-050A-LTLFireability-04 1042629 m, 34620 m/sec, 1042937 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/3525 17/32 ShieldIIPt-PT-050A-LTLFireability-04 1214223 m, 34318 m/sec, 1214531 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/3525 20/32 ShieldIIPt-PT-050A-LTLFireability-04 1390730 m, 35301 m/sec, 1391038 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/3525 22/32 ShieldIIPt-PT-050A-LTLFireability-04 1569599 m, 35773 m/sec, 1569907 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/3525 24/32 ShieldIIPt-PT-050A-LTLFireability-04 1745973 m, 35274 m/sec, 1746281 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/3525 26/32 ShieldIIPt-PT-050A-LTLFireability-04 1918490 m, 34503 m/sec, 1918798 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/3525 29/32 ShieldIIPt-PT-050A-LTLFireability-04 2091881 m, 34678 m/sec, 2092189 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/3525 31/32 ShieldIIPt-PT-050A-LTLFireability-04 2262426 m, 34109 m/sec, 2262734 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for ShieldIIPt-PT-050A-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-050A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-050A-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050A-LTLFireability-01: LTL false LTL model checker
ShieldIIPt-PT-050A-LTLFireability-03: LTL unknown AGGR
ShieldIIPt-PT-050A-LTLFireability-04: LTL unknown AGGR
ShieldIIPt-PT-050A-LTLFireability-14: LTL unknown AGGR


Time elapsed: 145 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldIIPt-PT-050A, 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 r391-oct2-167903715100324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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