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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
485.964 42802.00 69695.00 42.80 FFFFFFFFTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:29 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.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 18:00 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 105K 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-020A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679271276536

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:14:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:14:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:14:39] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-20 00:14:39] [INFO ] Transformed 383 places.
[2023-03-20 00:14:39] [INFO ] Transformed 283 transitions.
[2023-03-20 00:14:39] [INFO ] Found NUPN structural information;
[2023-03-20 00:14:39] [INFO ] Parsed PT model containing 383 places and 283 transitions and 1206 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-020A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 40 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-20 00:14:39] [INFO ] Computed 181 place invariants in 25 ms
[2023-03-20 00:14:40] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-20 00:14:40] [INFO ] Invariant cache hit.
[2023-03-20 00:14:40] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2023-03-20 00:14:40] [INFO ] Invariant cache hit.
[2023-03-20 00:14:41] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1826 ms. Remains : 383/383 places, 282/282 transitions.
Support contains 60 out of 383 places after structural reductions.
[2023-03-20 00:14:41] [INFO ] Flatten gal took : 79 ms
[2023-03-20 00:14:41] [INFO ] Flatten gal took : 27 ms
[2023-03-20 00:14:41] [INFO ] Input system was already deterministic with 282 transitions.
Support contains 58 out of 383 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 32) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-20 00:14:42] [INFO ] Invariant cache hit.
[2023-03-20 00:14:42] [INFO ] [Real]Absence check using 181 positive place invariants in 74 ms returned sat
[2023-03-20 00:14:43] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 00:14:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 91 ms returned sat
[2023-03-20 00:14:44] [INFO ] After 587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 00:14:44] [INFO ] After 1306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 539 ms.
[2023-03-20 00:14:45] [INFO ] After 2362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 3 properties in 755 ms.
Support contains 24 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 41 place count 381 transition count 280
Applied a total of 41 rules in 48 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 381/383 places, 280/282 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 280 rows 381 cols
[2023-03-20 00:14:47] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-20 00:14:47] [INFO ] [Real]Absence check using 181 positive place invariants in 22 ms returned sat
[2023-03-20 00:14:48] [INFO ] After 970ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:14:48] [INFO ] [Nat]Absence check using 181 positive place invariants in 38 ms returned sat
[2023-03-20 00:14:49] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 00:14:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-20 00:14:49] [INFO ] After 302ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 00:14:49] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 372 ms.
[2023-03-20 00:14:50] [INFO ] After 2088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 4 properties in 355 ms.
Support contains 16 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 280/280 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 381 transition count 280
Applied a total of 3 rules in 25 ms. Remains 381 /381 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 381/381 places, 280/280 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 280 rows 381 cols
[2023-03-20 00:14:51] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-20 00:14:51] [INFO ] [Real]Absence check using 181 positive place invariants in 19 ms returned sat
[2023-03-20 00:14:51] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:14:51] [INFO ] [Nat]Absence check using 181 positive place invariants in 21 ms returned sat
[2023-03-20 00:14:51] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:14:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-20 00:14:52] [INFO ] After 146ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:14:52] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-20 00:14:52] [INFO ] After 928ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 149 ms.
Support contains 13 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 280/280 transitions.
Applied a total of 0 rules in 12 ms. Remains 381 /381 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 381/381 places, 280/280 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 00:14:52] [INFO ] Invariant cache hit.
[2023-03-20 00:14:52] [INFO ] [Real]Absence check using 181 positive place invariants in 23 ms returned sat
[2023-03-20 00:14:53] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:14:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 20 ms returned sat
[2023-03-20 00:14:53] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:14:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-20 00:14:53] [INFO ] After 173ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 00:14:53] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-20 00:14:53] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 59 ms.
Support contains 6 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 280/280 transitions.
Applied a total of 0 rules in 9 ms. Remains 381 /381 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 381/381 places, 280/280 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3883 steps, run visited all 2 properties in 52 ms. (steps per millisecond=74 )
Probabilistic random walk after 3883 steps, saw 3694 distinct states, run finished after 52 ms. (steps per millisecond=74 ) properties seen :2
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' '!(F((G((p1&&F(p2)))&&p0)))'
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Applied a total of 4 rules in 25 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-20 00:14:54] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-20 00:14:55] [INFO ] Implicit Places using invariants in 428 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 430 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 14 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-20 00:14:55] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:14:55] [INFO ] Implicit Places using invariants in 363 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 365 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 38 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-20 00:14:55] [INFO ] Computed 178 place invariants in 3 ms
[2023-03-20 00:14:55] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-20 00:14:55] [INFO ] Invariant cache hit.
[2023-03-20 00:14:56] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1595 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s122 1) (EQ s133 1)), p1:(EQ s168 1), p2:(AND (EQ s122 1) (EQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 573 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-00 finished in 2660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 4 place count 381 transition count 280
Applied a total of 4 rules in 15 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-20 00:14:57] [INFO ] Computed 181 place invariants in 14 ms
[2023-03-20 00:14:57] [INFO ] Implicit Places using invariants in 337 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 338 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 11 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-20 00:14:57] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:14:57] [INFO ] Implicit Places using invariants in 214 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 11 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-20 00:14:57] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:14:58] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-20 00:14:58] [INFO ] Invariant cache hit.
[2023-03-20 00:14:58] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1407 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-01 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:(AND (EQ s242 1) (EQ s257 1)), p0:(OR (EQ s194 0) (EQ s207 0))], 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 32 reset in 458 ms.
Stack based approach found an accepted trace after 16592 steps with 7 reset with depth 1726 and stack size 1431 in 101 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-01 finished in 2084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(!p0)&&F(p1)) U G(p1))&&X(p0)))'
Support contains 5 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-20 00:14:59] [INFO ] Computed 181 place invariants in 13 ms
[2023-03-20 00:14:59] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-20 00:14:59] [INFO ] Invariant cache hit.
[2023-03-20 00:14:59] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-20 00:14:59] [INFO ] Invariant cache hit.
[2023-03-20 00:15:00] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 801 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), p0, (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s310 1) (EQ s319 1)), p0:(AND (EQ s144 1) (EQ s148 1) (EQ s154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8498 steps with 1 reset in 50 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-02 finished in 1045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&X(G(p0))))'
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 4 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:00] [INFO ] Invariant cache hit.
[2023-03-20 00:15:00] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-20 00:15:00] [INFO ] Invariant cache hit.
[2023-03-20 00:15:01] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-20 00:15:01] [INFO ] Invariant cache hit.
[2023-03-20 00:15:01] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1062 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s206 1), p1:(AND (EQ s326 1) (EQ s343 1) (EQ s32 1) (EQ s38 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-03 finished in 1323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F((p1&&X(X(p2)))))))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:01] [INFO ] Invariant cache hit.
[2023-03-20 00:15:02] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-20 00:15:02] [INFO ] Invariant cache hit.
[2023-03-20 00:15:02] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-20 00:15:02] [INFO ] Invariant cache hit.
[2023-03-20 00:15:02] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 909 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={0} source=4 dest: 6}, { cond=(NOT p1), acceptance={0} source=4 dest: 7}], [{ cond=p1, acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 0}, { cond=p1, acceptance={} source=9 dest: 1}]], initial=8, aps=[p1:(EQ s303 1), p0:(EQ s303 0), p2:(EQ s375 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 690 reset in 414 ms.
Stack based approach found an accepted trace after 7167 steps with 50 reset with depth 288 and stack size 288 in 52 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-04 finished in 1880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(!p1) U (p2&&G(!p1))))))'
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:03] [INFO ] Invariant cache hit.
[2023-03-20 00:15:03] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-20 00:15:03] [INFO ] Invariant cache hit.
[2023-03-20 00:15:04] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-20 00:15:04] [INFO ] Invariant cache hit.
[2023-03-20 00:15:04] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 783 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p2) p1), (NOT p0), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s277 1) (EQ s281 1) (EQ s287 1) (EQ s198 1) (EQ s209 1)), p2:(EQ s360 1), p1:(AND (EQ s277 1) (EQ s281 1) (EQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1910 steps with 0 reset in 8 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-05 finished in 1030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 8 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:04] [INFO ] Invariant cache hit.
[2023-03-20 00:15:04] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-20 00:15:04] [INFO ] Invariant cache hit.
[2023-03-20 00:15:05] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-20 00:15:05] [INFO ] Invariant cache hit.
[2023-03-20 00:15:05] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1027 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (EQ s69 0) (EQ s94 0)) (OR (EQ s178 0) (EQ s180 0))), p0:(OR (EQ s179 0) (EQ s190 0) (AND (EQ s27 1) (EQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15561 steps with 0 reset in 95 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-06 finished in 1275 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(X((F(p1)||p2)))&&p0)) U p1))'
Support contains 8 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 4 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:05] [INFO ] Invariant cache hit.
[2023-03-20 00:15:06] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-20 00:15:06] [INFO ] Invariant cache hit.
[2023-03-20 00:15:06] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-20 00:15:06] [INFO ] Invariant cache hit.
[2023-03-20 00:15:06] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s312 1) (EQ s323 1)), p2:(EQ s20 1), p0:(AND (EQ s353 1) (EQ s357 1) (EQ s363 1) (EQ s1 1) (EQ s18 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-07 finished in 1217 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||X((p1&&X(p1)))))))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:07] [INFO ] Invariant cache hit.
[2023-03-20 00:15:07] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-20 00:15:07] [INFO ] Invariant cache hit.
[2023-03-20 00:15:07] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2023-03-20 00:15:07] [INFO ] Invariant cache hit.
[2023-03-20 00:15:08] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1157 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s73 0), p1:(EQ s225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 844 ms.
Product exploration explored 100000 steps with 50000 reset in 847 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), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020A-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020A-LTLFireability-08 finished in 3136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Reduce places removed 1 places and 1 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 382 transition count 280
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 380 transition count 280
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 378 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 378 transition count 278
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 8 place count 377 transition count 278
Applied a total of 8 rules in 31 ms. Remains 377 /383 variables (removed 6) and now considering 278/282 (removed 4) transitions.
// Phase 1: matrix 278 rows 377 cols
[2023-03-20 00:15:10] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:15:10] [INFO ] Implicit Places using invariants in 330 ms returned [366]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 331 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/383 places, 278/282 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 375 transition count 277
Applied a total of 2 rules in 23 ms. Remains 375 /376 variables (removed 1) and now considering 277/278 (removed 1) transitions.
// Phase 1: matrix 277 rows 375 cols
[2023-03-20 00:15:10] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:15:10] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-20 00:15:10] [INFO ] Invariant cache hit.
[2023-03-20 00:15:11] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 375/383 places, 277/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1031 ms. Remains : 375/383 places, 277/282 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s281 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 259 reset in 408 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-09 finished in 1480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-20 00:15:11] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-20 00:15:11] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-20 00:15:11] [INFO ] Invariant cache hit.
[2023-03-20 00:15:12] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-20 00:15:12] [INFO ] Invariant cache hit.
[2023-03-20 00:15:12] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 857 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s119 0) (EQ s130 0)), p1:(AND (EQ s119 1) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99037 steps with 0 reset in 383 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-10 finished in 1405 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(G(!p0)) U G(p1))))'
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:13] [INFO ] Invariant cache hit.
[2023-03-20 00:15:13] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-20 00:15:13] [INFO ] Invariant cache hit.
[2023-03-20 00:15:13] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2023-03-20 00:15:13] [INFO ] Invariant cache hit.
[2023-03-20 00:15:14] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 893 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s82 1) (EQ s91 1) (EQ s229 1)), p0:(AND (EQ s82 1) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 397 ms.
Stack based approach found an accepted trace after 61282 steps with 0 reset with depth 61283 and stack size 33316 in 325 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-11 finished in 1751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 4 place count 381 transition count 280
Applied a total of 4 rules in 16 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-20 00:15:14] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-20 00:15:15] [INFO ] Implicit Places using invariants in 299 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 301 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 11 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-20 00:15:15] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:15:15] [INFO ] Implicit Places using invariants in 182 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 23 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-20 00:15:15] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:15:15] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-20 00:15:15] [INFO ] Invariant cache hit.
[2023-03-20 00:15:16] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1168 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s222 1) (NEQ s228 1) (NEQ s230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 420 ms.
Stack based approach found an accepted trace after 1154 steps with 0 reset with depth 1155 and stack size 880 in 6 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-13 finished in 1656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p1))&&p0)))))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-20 00:15:16] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-20 00:15:16] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-20 00:15:16] [INFO ] Invariant cache hit.
[2023-03-20 00:15:17] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2023-03-20 00:15:17] [INFO ] Invariant cache hit.
[2023-03-20 00:15:17] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s46 1) (EQ s57 1)), p0:(AND (EQ s46 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 461 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-14 finished in 1666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(G(!p1))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 4 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-20 00:15:18] [INFO ] Invariant cache hit.
[2023-03-20 00:15:18] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-20 00:15:18] [INFO ] Invariant cache hit.
[2023-03-20 00:15:18] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-20 00:15:18] [INFO ] Invariant cache hit.
[2023-03-20 00:15:19] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 93 ms :[p1, p1, true]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s160 1) (EQ s171 1)), p0:(AND (EQ s366 1) (EQ s377 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3579 steps with 0 reset in 18 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-15 finished in 954 ms.
All properties solved by simple procedures.
Total runtime 40040 ms.
ITS solved all properties within timeout

BK_STOP 1679271319338

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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