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

About the Execution of LTSMin+red for ShieldIIPt-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5437.348 124222.00 183803.00 83.30 FT?TFFTT?FTFFT?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.r393-oct2-167903716900307.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:24 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.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:42 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 212K 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-040A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679438981055

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:49:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:49:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:49:43] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-21 22:49:43] [INFO ] Transformed 763 places.
[2023-03-21 22:49:43] [INFO ] Transformed 563 transitions.
[2023-03-21 22:49:43] [INFO ] Found NUPN structural information;
[2023-03-21 22:49:43] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 81 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-21 22:49:43] [INFO ] Computed 361 place invariants in 16 ms
[2023-03-21 22:49:44] [INFO ] Implicit Places using invariants in 823 ms returned []
[2023-03-21 22:49:44] [INFO ] Invariant cache hit.
[2023-03-21 22:49:45] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2023-03-21 22:49:45] [INFO ] Invariant cache hit.
[2023-03-21 22:49:46] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2451 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 24 out of 763 places after structural reductions.
[2023-03-21 22:49:46] [INFO ] Flatten gal took : 152 ms
[2023-03-21 22:49:46] [INFO ] Flatten gal took : 68 ms
[2023-03-21 22:49:46] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 22 out of 763 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-21 22:49:47] [INFO ] Invariant cache hit.
[2023-03-21 22:49:48] [INFO ] [Real]Absence check using 361 positive place invariants in 75 ms returned sat
[2023-03-21 22:49:49] [INFO ] After 1361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:49:49] [INFO ] [Nat]Absence check using 361 positive place invariants in 58 ms returned sat
[2023-03-21 22:49:50] [INFO ] After 734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:49:51] [INFO ] After 1334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 378 ms.
[2023-03-21 22:49:51] [INFO ] After 2188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 263 ms.
Support contains 15 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
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 762 transition count 561
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 761 transition count 560
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 79 place count 761 transition count 560
Applied a total of 79 rules in 159 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) 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 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 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:49:52] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-21 22:49:52] [INFO ] [Real]Absence check using 361 positive place invariants in 87 ms returned sat
[2023-03-21 22:49:53] [INFO ] After 489ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-21 22:49:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-21 22:49:53] [INFO ] After 67ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 22:49:53] [INFO ] After 947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 22:49:53] [INFO ] [Nat]Absence check using 361 positive place invariants in 86 ms returned sat
[2023-03-21 22:49:54] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 22:49:54] [INFO ] After 304ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-21 22:49:55] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-21 22:49:55] [INFO ] After 2003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 108 ms.
Support contains 12 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 761 transition count 560
Applied a total of 1 rules in 64 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 171842 steps, run timeout after 3004 ms. (steps per millisecond=57 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 171842 steps, saw 165467 distinct states, run finished after 3005 ms. (steps per millisecond=57 ) properties seen :5
Running SMT prover for 2 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:49:59] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-21 22:49:59] [INFO ] [Real]Absence check using 361 positive place invariants in 51 ms returned sat
[2023-03-21 22:50:00] [INFO ] After 309ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-21 22:50:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-21 22:50:00] [INFO ] After 138ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:50:00] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:50:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 50 ms returned sat
[2023-03-21 22:50:01] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:50:01] [INFO ] After 123ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:50:01] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-21 22:50:01] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 761 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 760 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 758 transition count 558
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 757 transition count 558
Applied a total of 7 rules in 82 ms. Remains 757 /761 variables (removed 4) and now considering 558/560 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 757/761 places, 558/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) 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
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 209074 steps, run timeout after 3031 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 209074 steps, saw 200828 distinct states, run finished after 3033 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 558 rows 757 cols
[2023-03-21 22:50:04] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:50:05] [INFO ] [Real]Absence check using 359 positive place invariants in 41 ms returned sat
[2023-03-21 22:50:05] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:50:05] [INFO ] [Nat]Absence check using 359 positive place invariants in 83 ms returned sat
[2023-03-21 22:50:06] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:50:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-21 22:50:06] [INFO ] After 99ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 22:50:06] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-21 22:50:06] [INFO ] After 1019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 167 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 8 ms.
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(F((G(p1)||p0))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 69 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:50:06] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-21 22:50:07] [INFO ] Implicit Places using invariants in 445 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 448 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 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 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 24 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-21 22:50:07] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:50:07] [INFO ] Implicit Places using invariants in 469 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 500 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 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 756 transition count 558
Applied a total of 2 rules in 66 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-21 22:50:08] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:50:08] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-21 22:50:08] [INFO ] Invariant cache hit.
[2023-03-21 22:50:09] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2465 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s177 0) (EQ s729 1)), p0:(OR (EQ s7 0) (EQ s186 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 694 ms.
Product exploration explored 100000 steps with 0 reset in 842 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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 257 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 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 337950 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{1=1}
Probabilistic random walk after 337950 steps, saw 333816 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-21 22:50:14] [INFO ] Invariant cache hit.
[2023-03-21 22:50:15] [INFO ] [Real]Absence check using 358 positive place invariants in 112 ms returned sat
[2023-03-21 22:50:15] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:50:15] [INFO ] After 363ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:15] [INFO ] After 777ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:15] [INFO ] [Nat]Absence check using 358 positive place invariants in 60 ms returned sat
[2023-03-21 22:50:16] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:16] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-21 22:50:16] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 756 transition count 558
Applied a total of 77 rules in 40 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335010 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335010 steps, saw 315379 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2023-03-21 22:50:19] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:50:19] [INFO ] [Real]Absence check using 358 positive place invariants in 68 ms returned sat
[2023-03-21 22:50:20] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:20] [INFO ] [Nat]Absence check using 358 positive place invariants in 66 ms returned sat
[2023-03-21 22:50:20] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-21 22:50:20] [INFO ] After 110ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:20] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-21 22:50:20] [INFO ] After 867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 229 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 298 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 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 27 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-21 22:50:21] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:50:21] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-21 22:50:21] [INFO ] Invariant cache hit.
[2023-03-21 22:50:22] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2023-03-21 22:50:22] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-21 22:50:22] [INFO ] Invariant cache hit.
[2023-03-21 22:50:23] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1987 ms. Remains : 756/756 places, 558/558 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) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 248 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 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 322369 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{1=1}
Probabilistic random walk after 322369 steps, saw 318415 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-21 22:50:27] [INFO ] Invariant cache hit.
[2023-03-21 22:50:27] [INFO ] [Real]Absence check using 358 positive place invariants in 82 ms returned sat
[2023-03-21 22:50:27] [INFO ] After 274ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:50:27] [INFO ] After 324ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:27] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 62 ms returned sat
[2023-03-21 22:50:28] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:28] [INFO ] After 389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-21 22:50:28] [INFO ] After 658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 756 transition count 558
Applied a total of 77 rules in 33 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 351092 steps, run timeout after 3002 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 351092 steps, saw 330350 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2023-03-21 22:50:31] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:50:31] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2023-03-21 22:50:31] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:32] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2023-03-21 22:50:32] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-21 22:50:32] [INFO ] After 110ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:32] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-21 22:50:32] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 232 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 391 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 840 ms.
Product exploration explored 100000 steps with 0 reset in 737 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-21 22:50:34] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:50:35] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-21 22:50:35] [INFO ] Invariant cache hit.
[2023-03-21 22:50:36] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
[2023-03-21 22:50:36] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-21 22:50:36] [INFO ] Invariant cache hit.
[2023-03-21 22:50:36] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1789 ms. Remains : 756/756 places, 558/558 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-02 finished in 29923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-21 22:50:36] [INFO ] Computed 361 place invariants in 1 ms
[2023-03-21 22:50:37] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-21 22:50:37] [INFO ] Invariant cache hit.
[2023-03-21 22:50:38] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2023-03-21 22:50:38] [INFO ] Invariant cache hit.
[2023-03-21 22:50:38] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1912 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s748 1), p0:(OR (EQ s413 0) (EQ s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2169 reset in 862 ms.
Stack based approach found an accepted trace after 26 steps with 1 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-05 finished in 3026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:50:39] [INFO ] Invariant cache hit.
[2023-03-21 22:50:40] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-21 22:50:40] [INFO ] Invariant cache hit.
[2023-03-21 22:50:41] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2023-03-21 22:50:41] [INFO ] Invariant cache hit.
[2023-03-21 22:50:41] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2061 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s215 0), p1:(AND (NEQ s272 0) (NEQ s335 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 636 ms.
Product exploration explored 100000 steps with 0 reset in 750 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 p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) 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 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21412 steps, run visited all 2 properties in 230 ms. (steps per millisecond=93 )
Probabilistic random walk after 21412 steps, saw 20844 distinct states, run finished after 231 ms. (steps per millisecond=92 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 16 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:50:44] [INFO ] Invariant cache hit.
[2023-03-21 22:50:45] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-21 22:50:45] [INFO ] Invariant cache hit.
[2023-03-21 22:50:46] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2023-03-21 22:50:46] [INFO ] Invariant cache hit.
[2023-03-21 22:50:46] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1781 ms. Remains : 763/763 places, 562/562 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 p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21412 steps, run visited all 2 properties in 215 ms. (steps per millisecond=99 )
Probabilistic random walk after 21412 steps, saw 20844 distinct states, run finished after 216 ms. (steps per millisecond=99 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 419 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 714 ms.
Product exploration explored 100000 steps with 0 reset in 746 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 110 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:50:50] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2023-03-21 22:50:50] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 22:50:50] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 562/562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 600 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-21 22:50:51] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-21 22:50:51] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-21 22:50:51] [INFO ] Invariant cache hit.
[2023-03-21 22:50:52] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2023-03-21 22:50:52] [INFO ] Invariant cache hit.
[2023-03-21 22:50:52] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1677 ms. Remains : 763/763 places, 562/562 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-08 finished in 12960 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((X(p0) U p1)) U !(X(p1)||F(p2))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:50:52] [INFO ] Invariant cache hit.
[2023-03-21 22:50:53] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-21 22:50:53] [INFO ] Invariant cache hit.
[2023-03-21 22:50:54] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2023-03-21 22:50:54] [INFO ] Invariant cache hit.
[2023-03-21 22:50:54] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1896 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR p2 p1), p1, p2, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s465 1), p1:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 629 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-12 finished in 2730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p1)||G(p2))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:50:55] [INFO ] Invariant cache hit.
[2023-03-21 22:50:55] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-21 22:50:56] [INFO ] Invariant cache hit.
[2023-03-21 22:50:56] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2023-03-21 22:50:56] [INFO ] Invariant cache hit.
[2023-03-21 22:50:57] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1716 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(NEQ s398 1), p0:(OR (EQ s470 0) (EQ s241 1)), p2:(OR (EQ s298 0) (EQ s653 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2193 ms.
Product exploration explored 100000 steps with 50000 reset in 2229 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 p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0 p2)
Knowledge based reduction with 13 factoid took 531 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-13 finished in 6873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 12 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:51:02] [INFO ] Invariant cache hit.
[2023-03-21 22:51:02] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-21 22:51:02] [INFO ] Invariant cache hit.
[2023-03-21 22:51:03] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2023-03-21 22:51:03] [INFO ] Invariant cache hit.
[2023-03-21 22:51:04] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1713 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s88 1), p1:(AND (EQ s754 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 670 ms.
Product exploration explored 100000 steps with 0 reset in 775 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)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 366 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 405 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-21 22:51:06] [INFO ] Invariant cache hit.
[2023-03-21 22:51:07] [INFO ] [Real]Absence check using 361 positive place invariants in 288 ms returned sat
[2023-03-21 22:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:51:07] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2023-03-21 22:51:07] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-21 22:51:07] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:51:07] [INFO ] Invariant cache hit.
[2023-03-21 22:51:08] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-21 22:51:08] [INFO ] Invariant cache hit.
[2023-03-21 22:51:09] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2023-03-21 22:51:09] [INFO ] Invariant cache hit.
[2023-03-21 22:51:09] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1728 ms. Remains : 763/763 places, 562/562 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 : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-21 22:51:10] [INFO ] Invariant cache hit.
[2023-03-21 22:51:11] [INFO ] [Real]Absence check using 361 positive place invariants in 298 ms returned sat
[2023-03-21 22:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:51:11] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-21 22:51:11] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-21 22:51:11] [INFO ] Added : 0 causal constraints over 0 iterations in 108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 603 ms.
Product exploration explored 100000 steps with 0 reset in 776 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 64 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-21 22:51:13] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2023-03-21 22:51:13] [INFO ] Computed 361 place invariants in 1 ms
[2023-03-21 22:51:14] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 562/562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-21 22:51:14] [INFO ] Computed 361 place invariants in 1 ms
[2023-03-21 22:51:14] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-21 22:51:14] [INFO ] Invariant cache hit.
[2023-03-21 22:51:15] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2023-03-21 22:51:15] [INFO ] Invariant cache hit.
[2023-03-21 22:51:15] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1782 ms. Remains : 763/763 places, 562/562 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-14 finished in 13569 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((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040A-LTLCardinality-08
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
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 762 transition count 561
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 761 transition count 560
Applied a total of 4 rules in 39 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:51:16] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-21 22:51:16] [INFO ] Implicit Places using invariants in 382 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 398 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 759/763 places, 560/562 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 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 18 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-21 22:51:16] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:51:17] [INFO ] Implicit Places using invariants in 378 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 757/763 places, 559/562 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 756 transition count 558
Applied a total of 2 rules in 20 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-21 22:51:17] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:51:17] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-21 22:51:17] [INFO ] Invariant cache hit.
[2023-03-21 22:51:18] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2065 ms. Remains : 756/763 places, 558/562 transitions.
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s215 0), p1:(AND (NEQ s272 0) (NEQ s335 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 593 ms.
Product exploration explored 100000 steps with 0 reset in 742 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 p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21444 steps, run visited all 2 properties in 251 ms. (steps per millisecond=85 )
Probabilistic random walk after 21444 steps, saw 20834 distinct states, run finished after 252 ms. (steps per millisecond=85 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 12 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-21 22:51:21] [INFO ] Invariant cache hit.
[2023-03-21 22:51:21] [INFO ] Implicit Places using invariants in 526 ms returned []
[2023-03-21 22:51:21] [INFO ] Invariant cache hit.
[2023-03-21 22:51:22] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2023-03-21 22:51:22] [INFO ] Invariant cache hit.
[2023-03-21 22:51:23] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1937 ms. Remains : 756/756 places, 558/558 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 p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21444 steps, run visited all 2 properties in 256 ms. (steps per millisecond=83 )
Probabilistic random walk after 21444 steps, saw 20834 distinct states, run finished after 257 ms. (steps per millisecond=83 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 360 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 644 ms.
Product exploration explored 100000 steps with 0 reset in 737 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 27 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-21 22:51:26] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-21 22:51:26] [INFO ] Invariant cache hit.
[2023-03-21 22:51:27] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 446 ms. Remains : 756/756 places, 558/558 transitions.
Support contains 3 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 7 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-21 22:51:27] [INFO ] Invariant cache hit.
[2023-03-21 22:51:27] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-21 22:51:27] [INFO ] Invariant cache hit.
[2023-03-21 22:51:28] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2023-03-21 22:51:28] [INFO ] Invariant cache hit.
[2023-03-21 22:51:28] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1724 ms. Remains : 756/756 places, 558/558 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-08 finished in 12774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040A-LTLCardinality-14
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Applied a total of 2 rules in 23 ms. Remains 762 /763 variables (removed 1) and now considering 561/562 (removed 1) transitions.
// Phase 1: matrix 561 rows 762 cols
[2023-03-21 22:51:29] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-21 22:51:29] [INFO ] Implicit Places using invariants in 403 ms returned [755]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 761/763 places, 561/562 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 761 transition count 560
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 760 transition count 560
Applied a total of 2 rules in 15 ms. Remains 760 /761 variables (removed 1) and now considering 560/561 (removed 1) transitions.
// Phase 1: matrix 560 rows 760 cols
[2023-03-21 22:51:29] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 22:51:29] [INFO ] Implicit Places using invariants in 460 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 474 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 759/763 places, 560/562 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 758 transition count 559
Applied a total of 2 rules in 24 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-21 22:51:29] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-21 22:51:30] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-21 22:51:30] [INFO ] Invariant cache hit.
[2023-03-21 22:51:31] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 758/763 places, 559/562 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2501 ms. Remains : 758/763 places, 559/562 transitions.
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s88 1), p1:(AND (EQ s751 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 585 ms.
Product exploration explored 100000 steps with 0 reset in 743 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)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 403 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 530 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-21 22:51:34] [INFO ] Invariant cache hit.
[2023-03-21 22:51:34] [INFO ] [Real]Absence check using 359 positive place invariants in 222 ms returned sat
[2023-03-21 22:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:51:35] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2023-03-21 22:51:35] [INFO ] Computed and/alt/rep : 558/1990/558 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-21 22:51:35] [INFO ] Added : 0 causal constraints over 0 iterations in 95 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 758 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 559/559 transitions.
Applied a total of 0 rules in 8 ms. Remains 758 /758 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2023-03-21 22:51:35] [INFO ] Invariant cache hit.
[2023-03-21 22:51:36] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-21 22:51:36] [INFO ] Invariant cache hit.
[2023-03-21 22:51:37] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2023-03-21 22:51:37] [INFO ] Invariant cache hit.
[2023-03-21 22:51:37] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1958 ms. Remains : 758/758 places, 559/559 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 : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-21 22:51:38] [INFO ] Invariant cache hit.
[2023-03-21 22:51:38] [INFO ] [Real]Absence check using 359 positive place invariants in 166 ms returned sat
[2023-03-21 22:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:51:39] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2023-03-21 22:51:40] [INFO ] Computed and/alt/rep : 558/1990/558 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-21 22:51:40] [INFO ] Added : 0 causal constraints over 0 iterations in 97 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 654 ms.
Product exploration explored 100000 steps with 0 reset in 742 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 559/559 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 758 transition count 559
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 29 ms. Remains 758 /758 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2023-03-21 22:51:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 559 rows 758 cols
[2023-03-21 22:51:41] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:51:42] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/758 places, 559/559 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 758/758 places, 559/559 transitions.
Support contains 1 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 559/559 transitions.
Applied a total of 0 rules in 7 ms. Remains 758 /758 variables (removed 0) and now considering 559/559 (removed 0) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-21 22:51:42] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-21 22:51:42] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-21 22:51:42] [INFO ] Invariant cache hit.
[2023-03-21 22:51:43] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2023-03-21 22:51:43] [INFO ] Invariant cache hit.
[2023-03-21 22:51:44] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1804 ms. Remains : 758/758 places, 559/559 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-14 finished in 15392 ms.
[2023-03-21 22:51:44] [INFO ] Flatten gal took : 51 ms
[2023-03-21 22:51:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 22:51:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 763 places, 562 transitions and 2404 arcs took 7 ms.
Total runtime 120917 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1812/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1812/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1812/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-040A-LTLCardinality-02
Could not compute solution for formula : ShieldIIPt-PT-040A-LTLCardinality-08
Could not compute solution for formula : ShieldIIPt-PT-040A-LTLCardinality-14

BK_STOP 1679439105277

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-040A-LTLCardinality-02
ltl formula formula --ltl=/tmp/1812/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 763 places, 562 transitions and 2404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1812/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1812/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1812/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.030 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1812/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x558453d0e3f4]
1: pnml2lts-mc(+0xa2496) [0x558453d0e496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2794a84140]
3: pnml2lts-mc(+0x405be5) [0x558454071be5]
4: pnml2lts-mc(+0x16b3f9) [0x558453dd73f9]
5: pnml2lts-mc(+0x164ac4) [0x558453dd0ac4]
6: pnml2lts-mc(+0x272e0a) [0x558453edee0a]
7: pnml2lts-mc(+0xb61f0) [0x558453d221f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f27948d74d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f27948d767a]
10: pnml2lts-mc(+0xa1581) [0x558453d0d581]
11: pnml2lts-mc(+0xa1910) [0x558453d0d910]
12: pnml2lts-mc(+0xa32a2) [0x558453d0f2a2]
13: pnml2lts-mc(+0xa50f4) [0x558453d110f4]
14: pnml2lts-mc(+0xa516b) [0x558453d1116b]
15: pnml2lts-mc(+0x3f34b3) [0x55845405f4b3]
16: pnml2lts-mc(+0x7c63d) [0x558453ce863d]
17: pnml2lts-mc(+0x67d86) [0x558453cd3d86]
18: pnml2lts-mc(+0x60a8a) [0x558453ccca8a]
19: pnml2lts-mc(+0x5eb15) [0x558453ccab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f27948bfd0a]
21: pnml2lts-mc(+0x6075e) [0x558453ccc75e]
ltl formula name ShieldIIPt-PT-040A-LTLCardinality-08
ltl formula formula --ltl=/tmp/1812/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 763 places, 562 transitions and 2404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1812/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1812/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1812/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1812/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPt-PT-040A-LTLCardinality-14
ltl formula formula --ltl=/tmp/1812/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 763 places, 562 transitions and 2404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1812/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1812/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1812/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1812/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716900307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;