fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r373-tall-171683788800212
Last Updated
July 7, 2024

About the Execution of 2023-gold for ShieldIIPt-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16221.584 3600000.00 5663173.00 54381.90 FFFTFFFTFFFFTFT? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 13 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 539K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716957794475

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 04:43:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 04:43:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:43:16] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-29 04:43:16] [INFO ] Transformed 1903 places.
[2024-05-29 04:43:16] [INFO ] Transformed 1403 transitions.
[2024-05-29 04:43:16] [INFO ] Found NUPN structural information;
[2024-05-29 04:43:16] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 376 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 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 1641 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:43:21] [INFO ] Computed 901 invariants in 24 ms
[2024-05-29 04:43:23] [INFO ] Implicit Places using invariants in 1646 ms returned []
[2024-05-29 04:43:23] [INFO ] Invariant cache hit.
[2024-05-29 04:43:26] [INFO ] Implicit Places using invariants and state equation in 2831 ms returned []
Implicit Place search using SMT with State Equation took 7472 ms to find 0 implicit places.
[2024-05-29 04:43:26] [INFO ] Invariant cache hit.
[2024-05-29 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 941 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10056 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 29 out of 1903 places after structural reductions.
[2024-05-29 04:43:27] [INFO ] Flatten gal took : 293 ms
[2024-05-29 04:43:27] [INFO ] Flatten gal took : 140 ms
[2024-05-29 04:43:27] [INFO ] Input system was already deterministic with 1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-29 04:43:29] [INFO ] Invariant cache hit.
[2024-05-29 04:43:30] [INFO ] [Real]Absence check using 901 positive place invariants in 169 ms returned sat
[2024-05-29 04:43:32] [INFO ] After 2826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 04:43:33] [INFO ] [Nat]Absence check using 901 positive place invariants in 161 ms returned sat
[2024-05-29 04:43:40] [INFO ] After 6998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 04:43:45] [INFO ] After 11600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4544 ms.
[2024-05-29 04:43:49] [INFO ] After 17266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 1 properties in 2453 ms.
Support contains 18 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 36 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Applied a total of 202 rules in 417 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 88540 steps, run timeout after 3006 ms. (steps per millisecond=29 ) properties seen :{0=1, 1=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 88540 steps, saw 87114 distinct states, run finished after 3006 ms. (steps per millisecond=29 ) properties seen :5
Running SMT prover for 4 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:43:57] [INFO ] Computed 901 invariants in 16 ms
[2024-05-29 04:43:57] [INFO ] [Real]Absence check using 901 positive place invariants in 156 ms returned sat
[2024-05-29 04:43:58] [INFO ] After 1685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:43:59] [INFO ] [Nat]Absence check using 901 positive place invariants in 189 ms returned sat
[2024-05-29 04:44:03] [INFO ] After 3763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:44:03] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-29 04:44:08] [INFO ] After 4996ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:44:13] [INFO ] After 9996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10488 ms.
[2024-05-29 04:44:23] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2727 ms.
Support contains 9 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 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 1901 transition count 1400
Applied a total of 1 rules in 133 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107328 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{0=1}
Probabilistic random walk after 107328 steps, saw 105802 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:44:30] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 04:44:31] [INFO ] [Real]Absence check using 901 positive place invariants in 167 ms returned sat
[2024-05-29 04:44:32] [INFO ] After 1608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 04:44:32] [INFO ] [Nat]Absence check using 901 positive place invariants in 165 ms returned sat
[2024-05-29 04:44:35] [INFO ] After 3226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 04:44:35] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-29 04:44:42] [INFO ] After 6141ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 04:44:55] [INFO ] After 19990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1186 ms.
[2024-05-29 04:44:57] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2144 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 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 1901 transition count 1400
Applied a total of 1 rules in 154 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 111187 steps, run timeout after 3002 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111187 steps, saw 109627 distinct states, run finished after 3009 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:45:03] [INFO ] Computed 901 invariants in 7 ms
[2024-05-29 04:45:03] [INFO ] [Real]Absence check using 901 positive place invariants in 170 ms returned sat
[2024-05-29 04:45:04] [INFO ] After 1640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 04:45:05] [INFO ] [Nat]Absence check using 901 positive place invariants in 173 ms returned sat
[2024-05-29 04:45:08] [INFO ] After 2515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 04:45:08] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-29 04:45:12] [INFO ] After 4387ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 04:45:27] [INFO ] After 19840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2001 ms.
[2024-05-29 04:45:29] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3684 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 69 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 52 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 04:45:33] [INFO ] Invariant cache hit.
[2024-05-29 04:45:35] [INFO ] Implicit Places using invariants in 1723 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1729 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 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 1899 transition count 1399
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 1898 transition count 1399
Applied a total of 2 rules in 83 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:45:35] [INFO ] Computed 899 invariants in 10 ms
[2024-05-29 04:45:37] [INFO ] Implicit Places using invariants in 1676 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1679 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 204 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:45:37] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 04:45:38] [INFO ] Implicit Places using invariants in 1328 ms returned []
[2024-05-29 04:45:38] [INFO ] Invariant cache hit.
[2024-05-29 04:45:39] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:45:43] [INFO ] Implicit Places using invariants and state equation in 4947 ms returned []
Implicit Place search using SMT with State Equation took 6288 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 10035 ms. Remains : 1896/1901 places, 1398/1400 transitions.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 48 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:45:49] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 04:45:51] [INFO ] Implicit Places using invariants in 1656 ms returned []
[2024-05-29 04:45:51] [INFO ] Invariant cache hit.
[2024-05-29 04:45:53] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 4471 ms to find 0 implicit places.
[2024-05-29 04:45:53] [INFO ] Invariant cache hit.
[2024-05-29 04:45:55] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5844 ms. Remains : 1903/1903 places, 1402/1402 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1044 0) (EQ s670 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1463 ms.
Product exploration explored 100000 steps with 0 reset in 1852 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 : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 6626 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (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 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
[2024-05-29 04:46:05] [INFO ] Invariant cache hit.
[2024-05-29 04:46:08] [INFO ] [Real]Absence check using 901 positive place invariants in 1141 ms returned sat
[2024-05-29 04:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:46:08] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2024-05-29 04:46:09] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 206 ms.
[2024-05-29 04:46:09] [INFO ] Added : 0 causal constraints over 0 iterations in 390 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 60 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:46:09] [INFO ] Invariant cache hit.
[2024-05-29 04:46:11] [INFO ] Implicit Places using invariants in 1599 ms returned []
[2024-05-29 04:46:11] [INFO ] Invariant cache hit.
[2024-05-29 04:46:13] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 4488 ms to find 0 implicit places.
[2024-05-29 04:46:13] [INFO ] Invariant cache hit.
[2024-05-29 04:46:15] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5724 ms. Remains : 1903/1903 places, 1402/1402 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 p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
[2024-05-29 04:46:15] [INFO ] Invariant cache hit.
[2024-05-29 04:46:17] [INFO ] [Real]Absence check using 901 positive place invariants in 1065 ms returned sat
[2024-05-29 04:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:46:18] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2024-05-29 04:46:18] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints (skipped 0 transitions) in 92 ms.
[2024-05-29 04:46:19] [INFO ] Added : 0 causal constraints over 0 iterations in 238 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 1872 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1374 ms.
Product exploration explored 100000 steps with 0 reset in 1747 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1402
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 458 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:46:31] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:46:31] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 04:46:32] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2102 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin16479733209895093739
[2024-05-29 04:46:32] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16479733209895093739
Running compilation step : cd /tmp/ltsmin16479733209895093739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16479733209895093739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16479733209895093739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 55 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:46:35] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 04:46:37] [INFO ] Implicit Places using invariants in 1665 ms returned []
[2024-05-29 04:46:37] [INFO ] Invariant cache hit.
[2024-05-29 04:46:40] [INFO ] Implicit Places using invariants and state equation in 2864 ms returned []
Implicit Place search using SMT with State Equation took 4563 ms to find 0 implicit places.
[2024-05-29 04:46:40] [INFO ] Invariant cache hit.
[2024-05-29 04:46:41] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5954 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin15031342426606356167
[2024-05-29 04:46:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15031342426606356167
Running compilation step : cd /tmp/ltsmin15031342426606356167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2897 ms.
Running link step : cd /tmp/ltsmin15031342426606356167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15031342426606356167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased803766907353269013.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:47:00] [INFO ] Flatten gal took : 119 ms
[2024-05-29 04:47:00] [INFO ] Flatten gal took : 121 ms
[2024-05-29 04:47:00] [INFO ] Time to serialize gal into /tmp/LTL9113156182087682383.gal : 13 ms
[2024-05-29 04:47:00] [INFO ] Time to serialize properties into /tmp/LTL13937303264564168098.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9113156182087682383.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9470220067746063374.hoa' '-atoms' '/tmp/LTL13937303264564168098.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13937303264564168098.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9470220067746063374.hoa
Detected timeout of ITS tools.
[2024-05-29 04:47:16] [INFO ] Flatten gal took : 148 ms
[2024-05-29 04:47:16] [INFO ] Flatten gal took : 97 ms
[2024-05-29 04:47:16] [INFO ] Time to serialize gal into /tmp/LTL13374738806109816221.gal : 23 ms
[2024-05-29 04:47:19] [INFO ] Time to serialize properties into /tmp/LTL1317837644207560804.ltl : 2917 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13374738806109816221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1317837644207560804.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((p1044==0)&&(p670==1))"))))
Formula 0 simplified : XF!"((p1044==0)&&(p670==1))"
Detected timeout of ITS tools.
[2024-05-29 04:47:34] [INFO ] Flatten gal took : 127 ms
[2024-05-29 04:47:34] [INFO ] Applying decomposition
[2024-05-29 04:47:34] [INFO ] Flatten gal took : 184 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12280108725246428481.txt' '-o' '/tmp/graph12280108725246428481.bin' '-w' '/tmp/graph12280108725246428481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12280108725246428481.bin' '-l' '-1' '-v' '-w' '/tmp/graph12280108725246428481.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:47:34] [INFO ] Decomposing Gal with order
[2024-05-29 04:47:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:47:35] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 04:47:35] [INFO ] Flatten gal took : 217 ms
[2024-05-29 04:47:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 146 ms.
[2024-05-29 04:47:35] [INFO ] Time to serialize gal into /tmp/LTL10750122228117822447.gal : 35 ms
[2024-05-29 04:47:35] [INFO ] Time to serialize properties into /tmp/LTL11280066420132130546.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10750122228117822447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11280066420132130546.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G("((i21.i2.i2.u439.p1044==0)&&(i15.i0.i1.u282.p670==1))"))))
Formula 0 simplified : XF!"((i21.i2.i2.u439.p1044==0)&&(i15.i0.i1.u282.p670==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
264 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.90587,72904,1,0,108012,648,5735,246245,120,3865,151365
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-04 finished in 114872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (!p1 U (G(!p2)||G(p3)))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 194 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:47:39] [INFO ] Computed 901 invariants in 3 ms
[2024-05-29 04:47:40] [INFO ] Implicit Places using invariants in 1653 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1657 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 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 1899 transition count 1399
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 1898 transition count 1399
Applied a total of 2 rules in 75 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:47:40] [INFO ] Computed 899 invariants in 12 ms
[2024-05-29 04:47:42] [INFO ] Implicit Places using invariants in 1656 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1659 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
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 2 place count 1896 transition count 1398
Applied a total of 2 rules in 130 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:47:42] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 04:47:44] [INFO ] Implicit Places using invariants in 1575 ms returned []
[2024-05-29 04:47:44] [INFO ] Invariant cache hit.
[2024-05-29 04:47:47] [INFO ] Implicit Places using invariants and state equation in 2884 ms returned []
Implicit Place search using SMT with State Equation took 4460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8193 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 2229 ms :[(AND p2 (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 0}, { cond=(AND p2 p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=0 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(OR (EQ s1325 0) (EQ s1168 1)), p3:(OR (EQ s268 0) (EQ s103 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1335 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 2 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-05 finished in 11802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
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 1901 transition count 1400
Applied a total of 4 rules in 167 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:47:50] [INFO ] Computed 901 invariants in 4 ms
[2024-05-29 04:47:52] [INFO ] Implicit Places using invariants in 1628 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1639 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 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 1899 transition count 1399
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 1898 transition count 1399
Applied a total of 2 rules in 71 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:47:52] [INFO ] Computed 899 invariants in 10 ms
[2024-05-29 04:47:53] [INFO ] Implicit Places using invariants in 1450 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1463 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
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 2 place count 1896 transition count 1398
Applied a total of 2 rules in 116 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:47:54] [INFO ] Computed 898 invariants in 15 ms
[2024-05-29 04:47:55] [INFO ] Implicit Places using invariants in 1454 ms returned []
[2024-05-29 04:47:55] [INFO ] Invariant cache hit.
[2024-05-29 04:47:58] [INFO ] Implicit Places using invariants and state equation in 2825 ms returned []
Implicit Place search using SMT with State Equation took 4316 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7773 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s109 0) (EQ s349 1)), p1:(OR (EQ s1202 0) (EQ s932 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 1272 ms.
Product exploration explored 100000 steps with 0 reset in 1691 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 5885 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (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 :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:48:08] [INFO ] Invariant cache hit.
[2024-05-29 04:48:08] [INFO ] [Real]Absence check using 898 positive place invariants in 162 ms returned sat
[2024-05-29 04:48:09] [INFO ] After 1348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:48:09] [INFO ] [Nat]Absence check using 898 positive place invariants in 162 ms returned sat
[2024-05-29 04:48:12] [INFO ] After 2061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:48:12] [INFO ] After 2476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-29 04:48:12] [INFO ] After 3094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 162 ms.
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 197 place count 1896 transition count 1398
Applied a total of 197 rules in 117 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 154048 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154048 steps, saw 152137 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:48:16] [INFO ] Computed 898 invariants in 10 ms
[2024-05-29 04:48:16] [INFO ] [Real]Absence check using 898 positive place invariants in 204 ms returned sat
[2024-05-29 04:48:17] [INFO ] After 1432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:48:18] [INFO ] [Nat]Absence check using 898 positive place invariants in 158 ms returned sat
[2024-05-29 04:48:19] [INFO ] After 1724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:48:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:48:20] [INFO ] After 867ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:48:21] [INFO ] After 1261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-29 04:48:21] [INFO ] After 3626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 179 ms.
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 66 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 112 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:48:21] [INFO ] Invariant cache hit.
[2024-05-29 04:48:23] [INFO ] Implicit Places using invariants in 1576 ms returned []
[2024-05-29 04:48:23] [INFO ] Invariant cache hit.
[2024-05-29 04:48:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:48:29] [INFO ] Implicit Places using invariants and state equation in 6509 ms returned []
Implicit Place search using SMT with State Equation took 8121 ms to find 0 implicit places.
[2024-05-29 04:48:29] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 04:48:29] [INFO ] Invariant cache hit.
[2024-05-29 04:48:30] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9543 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 1896 transition count 1398
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1896 transition count 1298
Applied a total of 200 rules in 154 ms. Remains 1896 /1896 variables (removed 0) and now considering 1298/1398 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1298 rows 1896 cols
[2024-05-29 04:48:31] [INFO ] Computed 898 invariants in 2 ms
[2024-05-29 04:48:31] [INFO ] [Real]Absence check using 898 positive place invariants in 159 ms returned sat
[2024-05-29 04:48:32] [INFO ] After 1318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:48:32] [INFO ] [Nat]Absence check using 898 positive place invariants in 152 ms returned sat
[2024-05-29 04:48:34] [INFO ] After 1792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:48:35] [INFO ] After 2076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 275 ms.
[2024-05-29 04:48:35] [INFO ] After 2831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 99 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 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 64 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:48:35] [INFO ] Computed 898 invariants in 3 ms
[2024-05-29 04:48:36] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2024-05-29 04:48:37] [INFO ] Invariant cache hit.
[2024-05-29 04:48:39] [INFO ] Implicit Places using invariants and state equation in 2665 ms returned []
Implicit Place search using SMT with State Equation took 4069 ms to find 0 implicit places.
[2024-05-29 04:48:39] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-29 04:48:39] [INFO ] Invariant cache hit.
[2024-05-29 04:48:40] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5329 ms. Remains : 1896/1896 places, 1398/1398 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 (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1231 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:48:42] [INFO ] Invariant cache hit.
[2024-05-29 04:48:42] [INFO ] [Real]Absence check using 898 positive place invariants in 158 ms returned sat
[2024-05-29 04:48:43] [INFO ] After 1344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:48:44] [INFO ] [Nat]Absence check using 898 positive place invariants in 167 ms returned sat
[2024-05-29 04:48:46] [INFO ] After 2008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:48:46] [INFO ] After 2411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-29 04:48:46] [INFO ] After 3018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 174 ms.
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 197 place count 1896 transition count 1398
Applied a total of 197 rules in 110 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 156083 steps, run timeout after 3003 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 156083 steps, saw 154159 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:48:50] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 04:48:50] [INFO ] [Real]Absence check using 898 positive place invariants in 176 ms returned sat
[2024-05-29 04:48:51] [INFO ] After 1394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:48:52] [INFO ] [Nat]Absence check using 898 positive place invariants in 195 ms returned sat
[2024-05-29 04:48:54] [INFO ] After 1765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:48:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:48:55] [INFO ] After 896ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:48:55] [INFO ] After 1271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-29 04:48:55] [INFO ] After 3689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 166 ms.
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 52 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 53 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:48:55] [INFO ] Invariant cache hit.
[2024-05-29 04:48:57] [INFO ] Implicit Places using invariants in 1606 ms returned []
[2024-05-29 04:48:57] [INFO ] Invariant cache hit.
[2024-05-29 04:48:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:49:04] [INFO ] Implicit Places using invariants and state equation in 6708 ms returned []
Implicit Place search using SMT with State Equation took 8315 ms to find 0 implicit places.
[2024-05-29 04:49:04] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-29 04:49:04] [INFO ] Invariant cache hit.
[2024-05-29 04:49:05] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9612 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 1896 transition count 1398
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1896 transition count 1298
Applied a total of 200 rules in 189 ms. Remains 1896 /1896 variables (removed 0) and now considering 1298/1398 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1298 rows 1896 cols
[2024-05-29 04:49:05] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 04:49:06] [INFO ] [Real]Absence check using 898 positive place invariants in 186 ms returned sat
[2024-05-29 04:49:06] [INFO ] After 1373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:49:07] [INFO ] [Nat]Absence check using 898 positive place invariants in 165 ms returned sat
[2024-05-29 04:49:09] [INFO ] After 1813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:49:09] [INFO ] After 2100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 275 ms.
[2024-05-29 04:49:09] [INFO ] After 2876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 1829 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1179 ms.
Product exploration explored 100000 steps with 0 reset in 1681 ms.
Built C files in :
/tmp/ltsmin16850378751475521287
[2024-05-29 04:49:16] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2024-05-29 04:49:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:49:16] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2024-05-29 04:49:16] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:49:16] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2024-05-29 04:49:16] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:49:16] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16850378751475521287
Running compilation step : cd /tmp/ltsmin16850378751475521287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16850378751475521287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16850378751475521287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 56 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:49:19] [INFO ] Computed 898 invariants in 3 ms
[2024-05-29 04:49:21] [INFO ] Implicit Places using invariants in 1479 ms returned []
[2024-05-29 04:49:21] [INFO ] Invariant cache hit.
[2024-05-29 04:49:24] [INFO ] Implicit Places using invariants and state equation in 2917 ms returned []
Implicit Place search using SMT with State Equation took 4398 ms to find 0 implicit places.
[2024-05-29 04:49:24] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-29 04:49:24] [INFO ] Invariant cache hit.
[2024-05-29 04:49:25] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5718 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin8597331650772346177
[2024-05-29 04:49:29] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2024-05-29 04:49:29] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:49:29] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2024-05-29 04:49:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:49:29] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2024-05-29 04:49:29] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:49:29] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8597331650772346177
Running compilation step : cd /tmp/ltsmin8597331650772346177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8597331650772346177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8597331650772346177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:49:33] [INFO ] Flatten gal took : 93 ms
[2024-05-29 04:49:33] [INFO ] Flatten gal took : 92 ms
[2024-05-29 04:49:33] [INFO ] Time to serialize gal into /tmp/LTL6253025489583737440.gal : 8 ms
[2024-05-29 04:49:33] [INFO ] Time to serialize properties into /tmp/LTL11883609533944008115.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6253025489583737440.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11476213598044767008.hoa' '-atoms' '/tmp/LTL11883609533944008115.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11883609533944008115.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11476213598044767008.hoa
Detected timeout of ITS tools.
[2024-05-29 04:49:48] [INFO ] Flatten gal took : 90 ms
[2024-05-29 04:49:48] [INFO ] Flatten gal took : 90 ms
[2024-05-29 04:49:48] [INFO ] Time to serialize gal into /tmp/LTL17295008316095195423.gal : 7 ms
[2024-05-29 04:49:48] [INFO ] Time to serialize properties into /tmp/LTL16749245171146814122.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17295008316095195423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16749245171146814122.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p109==0)||(p349==1))")||(F("((p1202==0)||(p932==1))"))))))
Formula 0 simplified : G(F!"((p109==0)||(p349==1))" & FG!"((p1202==0)||(p932==1))")
Detected timeout of ITS tools.
[2024-05-29 04:50:03] [INFO ] Flatten gal took : 85 ms
[2024-05-29 04:50:03] [INFO ] Applying decomposition
[2024-05-29 04:50:03] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5469606205536041937.txt' '-o' '/tmp/graph5469606205536041937.bin' '-w' '/tmp/graph5469606205536041937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5469606205536041937.bin' '-l' '-1' '-v' '-w' '/tmp/graph5469606205536041937.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:50:05] [INFO ] Decomposing Gal with order
[2024-05-29 04:50:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:50:05] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 04:50:05] [INFO ] Flatten gal took : 158 ms
[2024-05-29 04:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 270 ms.
[2024-05-29 04:50:06] [INFO ] Time to serialize gal into /tmp/LTL17799596295210263253.gal : 29 ms
[2024-05-29 04:50:06] [INFO ] Time to serialize properties into /tmp/LTL18433878394698577332.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17799596295210263253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18433878394698577332.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i2.i0.i2.u45.p109==0)||(i7.u146.p349==1))")||(F("((i26.i1.i2.u506.p1202==0)||(i20.u392.p932==1))"))))))
Formula 0 simplified : G(F!"((i2.i0.i2.u45.p109==0)||(i7.u146.p349==1))" & FG!"((i26.i1.i2.u506.p1202==0)||(i20.u392.p932==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
327 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.54137,83140,1,0,127445,492,6433,293347,121,2026,176400
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-06 finished in 139538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 45 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:50:10] [INFO ] Computed 901 invariants in 8 ms
[2024-05-29 04:50:11] [INFO ] Implicit Places using invariants in 1438 ms returned []
[2024-05-29 04:50:11] [INFO ] Invariant cache hit.
[2024-05-29 04:50:14] [INFO ] Implicit Places using invariants and state equation in 2833 ms returned []
Implicit Place search using SMT with State Equation took 4289 ms to find 0 implicit places.
[2024-05-29 04:50:14] [INFO ] Invariant cache hit.
[2024-05-29 04:50:15] [INFO ] Dead Transitions using invariants and state equation in 1278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5624 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1701 0) (EQ s1712 1)), p1:(AND (EQ s1275 0) (EQ s1692 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]]
Product exploration explored 100000 steps with 0 reset in 1216 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 3 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-08 finished in 7066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 48 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:50:17] [INFO ] Invariant cache hit.
[2024-05-29 04:50:18] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2024-05-29 04:50:18] [INFO ] Invariant cache hit.
[2024-05-29 04:50:21] [INFO ] Implicit Places using invariants and state equation in 2787 ms returned []
Implicit Place search using SMT with State Equation took 4201 ms to find 0 implicit places.
[2024-05-29 04:50:21] [INFO ] Invariant cache hit.
[2024-05-29 04:50:22] [INFO ] Dead Transitions using invariants and state equation in 1281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5552 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s832 1), p1:(OR (EQ s1737 0) (EQ s40 1) (EQ s136 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6251 ms.
Product exploration explored 100000 steps with 50000 reset in 6446 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) p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-12 finished in 18472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1902 transition count 1400
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1900 transition count 1400
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1898 transition count 1399
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 1898 transition count 1398
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 8 place count 1897 transition count 1398
Applied a total of 8 rules in 159 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
// Phase 1: matrix 1398 rows 1897 cols
[2024-05-29 04:50:35] [INFO ] Computed 899 invariants in 2 ms
[2024-05-29 04:50:37] [INFO ] Implicit Places using invariants in 1470 ms returned [1886]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1489 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1896/1903 places, 1398/1402 transitions.
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 2 place count 1895 transition count 1397
Applied a total of 2 rules in 109 ms. Remains 1895 /1896 variables (removed 1) and now considering 1397/1398 (removed 1) transitions.
// Phase 1: matrix 1397 rows 1895 cols
[2024-05-29 04:50:37] [INFO ] Computed 898 invariants in 4 ms
[2024-05-29 04:50:38] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-29 04:50:38] [INFO ] Invariant cache hit.
[2024-05-29 04:50:41] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 3658 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1895/1903 places, 1397/1402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5420 ms. Remains : 1895/1903 places, 1397/1402 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1204 0) (EQ s1093 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1390 ms.
Product exploration explored 100000 steps with 0 reset in 1769 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Finished probabilistic random walk after 28570 steps, run visited all 1 properties in 601 ms. (steps per millisecond=47 )
Probabilistic random walk after 28570 steps, saw 27877 distinct states, run finished after 605 ms. (steps per millisecond=47 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 68 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2024-05-29 04:50:45] [INFO ] Invariant cache hit.
[2024-05-29 04:50:47] [INFO ] Implicit Places using invariants in 1377 ms returned []
[2024-05-29 04:50:47] [INFO ] Invariant cache hit.
[2024-05-29 04:50:49] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
[2024-05-29 04:50:49] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 04:50:49] [INFO ] Invariant cache hit.
[2024-05-29 04:50:50] [INFO ] Dead Transitions using invariants and state equation in 1225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5124 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Finished probabilistic random walk after 28570 steps, run visited all 1 properties in 591 ms. (steps per millisecond=48 )
Probabilistic random walk after 28570 steps, saw 27877 distinct states, run finished after 593 ms. (steps per millisecond=48 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1317 ms.
Product exploration explored 100000 steps with 0 reset in 1677 ms.
Built C files in :
/tmp/ltsmin9952863495940227163
[2024-05-29 04:50:55] [INFO ] Computing symmetric may disable matrix : 1397 transitions.
[2024-05-29 04:50:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:50:55] [INFO ] Computing symmetric may enable matrix : 1397 transitions.
[2024-05-29 04:50:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:50:55] [INFO ] Computing Do-Not-Accords matrix : 1397 transitions.
[2024-05-29 04:50:55] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:50:55] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9952863495940227163
Running compilation step : cd /tmp/ltsmin9952863495940227163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9952863495940227163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9952863495940227163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 55 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2024-05-29 04:50:58] [INFO ] Invariant cache hit.
[2024-05-29 04:51:00] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2024-05-29 04:51:00] [INFO ] Invariant cache hit.
[2024-05-29 04:51:02] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 3877 ms to find 0 implicit places.
[2024-05-29 04:51:02] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-29 04:51:02] [INFO ] Invariant cache hit.
[2024-05-29 04:51:03] [INFO ] Dead Transitions using invariants and state equation in 1208 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5171 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Built C files in :
/tmp/ltsmin5968175949869462074
[2024-05-29 04:51:03] [INFO ] Computing symmetric may disable matrix : 1397 transitions.
[2024-05-29 04:51:03] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:51:03] [INFO ] Computing symmetric may enable matrix : 1397 transitions.
[2024-05-29 04:51:03] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:51:04] [INFO ] Computing Do-Not-Accords matrix : 1397 transitions.
[2024-05-29 04:51:04] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:51:04] [INFO ] Built C files in 327ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5968175949869462074
Running compilation step : cd /tmp/ltsmin5968175949869462074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5968175949869462074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5968175949869462074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:51:07] [INFO ] Flatten gal took : 47 ms
[2024-05-29 04:51:07] [INFO ] Flatten gal took : 54 ms
[2024-05-29 04:51:07] [INFO ] Time to serialize gal into /tmp/LTL17773188451654669733.gal : 7 ms
[2024-05-29 04:51:07] [INFO ] Time to serialize properties into /tmp/LTL10745645389432981999.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17773188451654669733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14176827556328220206.hoa' '-atoms' '/tmp/LTL10745645389432981999.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10745645389432981999.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14176827556328220206.hoa
Detected timeout of ITS tools.
[2024-05-29 04:51:22] [INFO ] Flatten gal took : 36 ms
[2024-05-29 04:51:22] [INFO ] Flatten gal took : 37 ms
[2024-05-29 04:51:22] [INFO ] Time to serialize gal into /tmp/LTL10021304978261872172.gal : 7 ms
[2024-05-29 04:51:22] [INFO ] Time to serialize properties into /tmp/LTL5019619591352622629.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10021304978261872172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5019619591352622629.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p1205==0)||(p1094==1))"))))
Formula 0 simplified : FG!"((p1205==0)||(p1094==1))"
Detected timeout of ITS tools.
[2024-05-29 04:51:37] [INFO ] Flatten gal took : 47 ms
[2024-05-29 04:51:37] [INFO ] Applying decomposition
[2024-05-29 04:51:37] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15319496560797173707.txt' '-o' '/tmp/graph15319496560797173707.bin' '-w' '/tmp/graph15319496560797173707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15319496560797173707.bin' '-l' '-1' '-v' '-w' '/tmp/graph15319496560797173707.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:51:37] [INFO ] Decomposing Gal with order
[2024-05-29 04:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:51:38] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 04:51:38] [INFO ] Flatten gal took : 88 ms
[2024-05-29 04:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 04:51:38] [INFO ] Time to serialize gal into /tmp/LTL1711432742375014415.gal : 22 ms
[2024-05-29 04:51:38] [INFO ] Time to serialize properties into /tmp/LTL16923583450369970269.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1711432742375014415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16923583450369970269.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i27.u506.p1205==0)||(i24.i1.i3.u459.p1094==1))"))))
Formula 0 simplified : FG!"((i27.u506.p1205==0)||(i24.i1.i3.u459.p1094==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
167 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.89515,54444,1,0,72261,185,4962,143134,115,728,138597
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-13 finished in 64698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(F(!p1)&&X((X(p0)&&F(!p2)))))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 45 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:51:40] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 04:51:41] [INFO ] Implicit Places using invariants in 1376 ms returned []
[2024-05-29 04:51:41] [INFO ] Invariant cache hit.
[2024-05-29 04:51:44] [INFO ] Implicit Places using invariants and state equation in 2806 ms returned []
Implicit Place search using SMT with State Equation took 4227 ms to find 0 implicit places.
[2024-05-29 04:51:44] [INFO ] Invariant cache hit.
[2024-05-29 04:51:45] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5595 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={0} source=8 dest: 8}], [{ cond=p1, acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(OR (EQ s489 0) (EQ s1767 1)), p2:(OR (EQ s980 0) (EQ s1292 1)), p0:(OR (EQ s1177 0) (EQ s1706 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1336 ms.
Product exploration explored 100000 steps with 2 reset in 1758 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 p2 p0), (X p1), (X (X p2)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 102813 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 6=1}
Probabilistic random walk after 102813 steps, saw 101678 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :6
Running SMT prover for 1 properties.
[2024-05-29 04:51:54] [INFO ] Invariant cache hit.
[2024-05-29 04:51:54] [INFO ] [Real]Absence check using 901 positive place invariants in 160 ms returned sat
[2024-05-29 04:51:55] [INFO ] After 1315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:51:56] [INFO ] [Nat]Absence check using 901 positive place invariants in 156 ms returned sat
[2024-05-29 04:51:57] [INFO ] After 1710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:51:57] [INFO ] After 1835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-29 04:51:58] [INFO ] After 2422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 204 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160166 steps, run timeout after 3003 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160166 steps, saw 158185 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:52:01] [INFO ] Computed 901 invariants in 9 ms
[2024-05-29 04:52:02] [INFO ] [Real]Absence check using 901 positive place invariants in 164 ms returned sat
[2024-05-29 04:52:03] [INFO ] After 1389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:52:03] [INFO ] [Nat]Absence check using 901 positive place invariants in 163 ms returned sat
[2024-05-29 04:52:05] [INFO ] After 1606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:05] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-29 04:52:05] [INFO ] After 279ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:05] [INFO ] After 624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 709 ms.
[2024-05-29 04:52:06] [INFO ] After 3466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 855 ms.
Support contains 2 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 48 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 49 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 04:52:07] [INFO ] Invariant cache hit.
[2024-05-29 04:52:09] [INFO ] Implicit Places using invariants in 1540 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1551 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 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 1899 transition count 1399
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 1898 transition count 1399
Applied a total of 2 rules in 57 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:52:09] [INFO ] Computed 899 invariants in 3 ms
[2024-05-29 04:52:10] [INFO ] Implicit Places using invariants in 1545 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1571 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 109 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:52:10] [INFO ] Computed 898 invariants in 4 ms
[2024-05-29 04:52:12] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2024-05-29 04:52:12] [INFO ] Invariant cache hit.
[2024-05-29 04:52:13] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:52:16] [INFO ] Implicit Places using invariants and state equation in 4723 ms returned []
Implicit Place search using SMT with State Equation took 6033 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9376 ms. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 171573 steps, run timeout after 3003 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171573 steps, saw 169538 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:52:20] [INFO ] Invariant cache hit.
[2024-05-29 04:52:20] [INFO ] [Real]Absence check using 898 positive place invariants in 152 ms returned sat
[2024-05-29 04:52:21] [INFO ] After 1411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:52:21] [INFO ] [Nat]Absence check using 898 positive place invariants in 161 ms returned sat
[2024-05-29 04:52:23] [INFO ] After 1388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:52:24] [INFO ] After 780ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:24] [INFO ] After 1003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-29 04:52:24] [INFO ] After 3023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 122 ms.
Support contains 2 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 58 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 54 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:52:24] [INFO ] Invariant cache hit.
[2024-05-29 04:52:25] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2024-05-29 04:52:25] [INFO ] Invariant cache hit.
[2024-05-29 04:52:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:52:30] [INFO ] Implicit Places using invariants and state equation in 4827 ms returned []
Implicit Place search using SMT with State Equation took 6096 ms to find 0 implicit places.
[2024-05-29 04:52:30] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-29 04:52:30] [INFO ] Invariant cache hit.
[2024-05-29 04:52:31] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7260 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 1896 transition count 1398
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1896 transition count 1298
Applied a total of 200 rules in 145 ms. Remains 1896 /1896 variables (removed 0) and now considering 1298/1398 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1298 rows 1896 cols
[2024-05-29 04:52:32] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 04:52:32] [INFO ] [Real]Absence check using 898 positive place invariants in 159 ms returned sat
[2024-05-29 04:52:33] [INFO ] After 1200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:52:33] [INFO ] [Nat]Absence check using 898 positive place invariants in 160 ms returned sat
[2024-05-29 04:52:35] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:35] [INFO ] After 2042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 335 ms.
[2024-05-29 04:52:36] [INFO ] After 2832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0), (X p1), (X (X p2)), true, (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 43 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:52:37] [INFO ] Computed 901 invariants in 3 ms
[2024-05-29 04:52:38] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2024-05-29 04:52:38] [INFO ] Invariant cache hit.
[2024-05-29 04:52:41] [INFO ] Implicit Places using invariants and state equation in 2778 ms returned []
Implicit Place search using SMT with State Equation took 4256 ms to find 0 implicit places.
[2024-05-29 04:52:41] [INFO ] Invariant cache hit.
[2024-05-29 04:52:42] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5561 ms. Remains : 1903/1903 places, 1402/1402 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 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 152349 steps, run timeout after 3003 ms. (steps per millisecond=50 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 6=1}
Probabilistic random walk after 152349 steps, saw 150810 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :6
Running SMT prover for 1 properties.
[2024-05-29 04:52:47] [INFO ] Invariant cache hit.
[2024-05-29 04:52:47] [INFO ] [Real]Absence check using 901 positive place invariants in 160 ms returned sat
[2024-05-29 04:52:48] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:52:49] [INFO ] [Nat]Absence check using 901 positive place invariants in 164 ms returned sat
[2024-05-29 04:52:50] [INFO ] After 1655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:50] [INFO ] After 1765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-29 04:52:51] [INFO ] After 2390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
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 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 223 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 175010 steps, run timeout after 3003 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175010 steps, saw 172940 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:52:54] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 04:52:55] [INFO ] [Real]Absence check using 901 positive place invariants in 161 ms returned sat
[2024-05-29 04:52:55] [INFO ] After 1318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:52:56] [INFO ] [Nat]Absence check using 901 positive place invariants in 159 ms returned sat
[2024-05-29 04:52:58] [INFO ] After 1608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:58] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-29 04:52:58] [INFO ] After 277ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:52:58] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 707 ms.
[2024-05-29 04:52:59] [INFO ] After 3456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 777 ms.
Support contains 2 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 48 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 48 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 04:53:00] [INFO ] Invariant cache hit.
[2024-05-29 04:53:01] [INFO ] Implicit Places using invariants in 1499 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1513 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 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 1899 transition count 1399
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 1898 transition count 1399
Applied a total of 2 rules in 56 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:53:01] [INFO ] Computed 899 invariants in 3 ms
[2024-05-29 04:53:03] [INFO ] Implicit Places using invariants in 1487 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1496 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 89 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:53:03] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 04:53:04] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2024-05-29 04:53:04] [INFO ] Invariant cache hit.
[2024-05-29 04:53:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:53:09] [INFO ] Implicit Places using invariants and state equation in 4825 ms returned []
Implicit Place search using SMT with State Equation took 6070 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9273 ms. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 169983 steps, run timeout after 3003 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169983 steps, saw 167957 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:53:12] [INFO ] Invariant cache hit.
[2024-05-29 04:53:13] [INFO ] [Real]Absence check using 898 positive place invariants in 152 ms returned sat
[2024-05-29 04:53:13] [INFO ] After 1232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:53:14] [INFO ] [Nat]Absence check using 898 positive place invariants in 157 ms returned sat
[2024-05-29 04:53:15] [INFO ] After 1385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:53:15] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:53:16] [INFO ] After 812ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:53:16] [INFO ] After 1036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2024-05-29 04:53:16] [INFO ] After 3004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 130 ms.
Support contains 2 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 60 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 77 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:53:17] [INFO ] Invariant cache hit.
[2024-05-29 04:53:18] [INFO ] Implicit Places using invariants in 1381 ms returned []
[2024-05-29 04:53:18] [INFO ] Invariant cache hit.
[2024-05-29 04:53:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-29 04:53:23] [INFO ] Implicit Places using invariants and state equation in 4950 ms returned []
Implicit Place search using SMT with State Equation took 6365 ms to find 0 implicit places.
[2024-05-29 04:53:23] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 04:53:23] [INFO ] Invariant cache hit.
[2024-05-29 04:53:24] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7554 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 1896 transition count 1398
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1896 transition count 1298
Applied a total of 200 rules in 192 ms. Remains 1896 /1896 variables (removed 0) and now considering 1298/1398 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1298 rows 1896 cols
[2024-05-29 04:53:24] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 04:53:25] [INFO ] [Real]Absence check using 898 positive place invariants in 221 ms returned sat
[2024-05-29 04:53:26] [INFO ] After 1281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:53:26] [INFO ] [Nat]Absence check using 898 positive place invariants in 155 ms returned sat
[2024-05-29 04:53:28] [INFO ] After 1639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:53:28] [INFO ] After 2017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 337 ms.
[2024-05-29 04:53:28] [INFO ] After 2796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Product exploration explored 100000 steps with 1 reset in 1183 ms.
Product exploration explored 100000 steps with 0 reset in 1579 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p1 (NOT p0)), true, p2, p1]
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1402
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 110 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:53:33] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:53:33] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 04:53:34] [INFO ] Dead Transitions using invariants and state equation in 1277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1435 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin2164780098460879682
[2024-05-29 04:53:34] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2164780098460879682
Running compilation step : cd /tmp/ltsmin2164780098460879682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2745 ms.
Running link step : cd /tmp/ltsmin2164780098460879682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2164780098460879682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14181304833744557321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 44 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:53:49] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 04:53:51] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2024-05-29 04:53:51] [INFO ] Invariant cache hit.
[2024-05-29 04:53:54] [INFO ] Implicit Places using invariants and state equation in 2992 ms returned []
Implicit Place search using SMT with State Equation took 4378 ms to find 0 implicit places.
[2024-05-29 04:53:54] [INFO ] Invariant cache hit.
[2024-05-29 04:53:55] [INFO ] Dead Transitions using invariants and state equation in 1358 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5781 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin7946610411738089348
[2024-05-29 04:53:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7946610411738089348
Running compilation step : cd /tmp/ltsmin7946610411738089348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2896 ms.
Running link step : cd /tmp/ltsmin7946610411738089348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7946610411738089348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17765082338228998585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:54:10] [INFO ] Flatten gal took : 83 ms
[2024-05-29 04:54:10] [INFO ] Flatten gal took : 84 ms
[2024-05-29 04:54:10] [INFO ] Time to serialize gal into /tmp/LTL3774779143341370568.gal : 7 ms
[2024-05-29 04:54:10] [INFO ] Time to serialize properties into /tmp/LTL2680568181019308145.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3774779143341370568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11337257627388123911.hoa' '-atoms' '/tmp/LTL2680568181019308145.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2680568181019308145.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11337257627388123911.hoa
Detected timeout of ITS tools.
[2024-05-29 04:54:25] [INFO ] Flatten gal took : 94 ms
[2024-05-29 04:54:25] [INFO ] Flatten gal took : 83 ms
[2024-05-29 04:54:25] [INFO ] Time to serialize gal into /tmp/LTL3376109453614280438.gal : 6 ms
[2024-05-29 04:54:25] [INFO ] Time to serialize properties into /tmp/LTL10473733800578443554.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3376109453614280438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10473733800578443554.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G("((p1177==0)||(p1706==1))"))))||((F("((p489==1)&&(p1767==0))"))&&(X((X("((p1177==0)||(p1706==1))"))&&(F("((p980==1)&&(p129...170
Formula 0 simplified : X(XXF!"((p1177==0)||(p1706==1))" & (G!"((p489==1)&&(p1767==0))" | X(X!"((p1177==0)||(p1706==1))" | G!"((p980==1)&&(p1292==0))")))
Detected timeout of ITS tools.
[2024-05-29 04:54:41] [INFO ] Flatten gal took : 83 ms
[2024-05-29 04:54:41] [INFO ] Applying decomposition
[2024-05-29 04:54:41] [INFO ] Flatten gal took : 87 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12379246853755402474.txt' '-o' '/tmp/graph12379246853755402474.bin' '-w' '/tmp/graph12379246853755402474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12379246853755402474.bin' '-l' '-1' '-v' '-w' '/tmp/graph12379246853755402474.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:54:41] [INFO ] Decomposing Gal with order
[2024-05-29 04:54:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:54:41] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 04:54:41] [INFO ] Flatten gal took : 67 ms
[2024-05-29 04:54:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 71 ms.
[2024-05-29 04:54:41] [INFO ] Time to serialize gal into /tmp/LTL13467878792890005615.gal : 33 ms
[2024-05-29 04:54:41] [INFO ] Time to serialize properties into /tmp/LTL14663178145741620772.ltl : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13467878792890005615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14663178145741620772.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G("((i28.i0.i1.u495.p1177==0)||(i39.i1.i1.u717.p1706==1))"))))||((F("((i11.i1.i2.u205.p489==1)&&(i41.u743.p1767==0))"))&&(X(...284
Formula 0 simplified : X(XXF!"((i28.i0.i1.u495.p1177==0)||(i39.i1.i1.u717.p1706==1))" & (G!"((i11.i1.i2.u205.p489==1)&&(i41.u743.p1767==0))" | X(X!"((i28.i...266
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11156555125801640844
[2024-05-29 04:54:56] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11156555125801640844
Running compilation step : cd /tmp/ltsmin11156555125801640844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2800 ms.
Running link step : cd /tmp/ltsmin11156555125801640844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11156555125801640844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X([]((LTLAPp0==true))))||(<>((LTLAPp1==true))&&X((X((LTLAPp0==true))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-15 finished in 211344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(F(!p1)&&X((X(p0)&&F(!p2)))))))'
[2024-05-29 04:55:11] [INFO ] Flatten gal took : 121 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7434809302730570916
[2024-05-29 04:55:11] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2024-05-29 04:55:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:55:11] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2024-05-29 04:55:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:55:12] [INFO ] Applying decomposition
[2024-05-29 04:55:12] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph863331710268534539.txt' '-o' '/tmp/graph863331710268534539.bin' '-w' '/tmp/graph863331710268534539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph863331710268534539.bin' '-l' '-1' '-v' '-w' '/tmp/graph863331710268534539.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:55:12] [INFO ] Decomposing Gal with order
[2024-05-29 04:55:12] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2024-05-29 04:55:12] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:55:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:55:12] [INFO ] Built C files in 347ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7434809302730570916
Running compilation step : cd /tmp/ltsmin7434809302730570916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 04:55:12] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 04:55:12] [INFO ] Flatten gal took : 70 ms
[2024-05-29 04:55:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 57 ms.
[2024-05-29 04:55:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality13835026027049052477.gal : 23 ms
[2024-05-29 04:55:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality11256596943040114581.ltl : 37 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13835026027049052477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11256596943040114581.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G("((i27.i0.i0.u495.p1177==0)||(i39.i1.i1.u717.p1706==1))"))))||((F(!("((i11.i1.i0.u205.p489==0)||(i41.u743.p1767==1))")))&&...284
Formula 0 simplified : X(XXF!"((i27.i0.i0.u495.p1177==0)||(i39.i1.i1.u717.p1706==1))" & (G"((i11.i1.i0.u205.p489==0)||(i41.u743.p1767==1))" | X(X!"((i27.i0...258
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 5226 ms.
Running link step : cd /tmp/ltsmin7434809302730570916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin7434809302730570916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X([]((LTLAPp0==true))))||(<>(!(LTLAPp1==true))&&X((X((LTLAPp0==true))&&<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.600: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.600: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.600: LTL layer: formula: X((X(X([]((LTLAPp0==true))))||(<>(!(LTLAPp1==true))&&X((X((LTLAPp0==true))&&<>(!(LTLAPp2==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.604: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.605: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.613: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.650: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.650: "X((X(X([]((LTLAPp0==true))))||(<>(!(LTLAPp1==true))&&X((X((LTLAPp0==true))&&<>(!(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.652: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.659: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.698: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.919: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.527: DFS-FIFO for weak LTL, using special progress label 1406
pins2lts-mc-linux64( 0/ 8), 2.527: There are 1407 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.527: State length is 1904, there are 1436 groups
pins2lts-mc-linux64( 0/ 8), 2.527: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.527: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.527: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 2.527: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 4.599: ~1 levels ~960 states ~5272 transitions
pins2lts-mc-linux64( 2/ 8), 5.042: ~1 levels ~1920 states ~11024 transitions
pins2lts-mc-linux64( 2/ 8), 5.813: ~1 levels ~3840 states ~25200 transitions
pins2lts-mc-linux64( 2/ 8), 7.099: ~1 levels ~7680 states ~52304 transitions
pins2lts-mc-linux64( 2/ 8), 10.143: ~1 levels ~15360 states ~119008 transitions
pins2lts-mc-linux64( 3/ 8), 15.777: ~1 levels ~30720 states ~238952 transitions
pins2lts-mc-linux64( 3/ 8), 24.757: ~1 levels ~61440 states ~501032 transitions
pins2lts-mc-linux64( 1/ 8), 48.104: ~1 levels ~122880 states ~1070248 transitions
pins2lts-mc-linux64( 3/ 8), 92.462: ~1 levels ~245760 states ~2223576 transitions
pins2lts-mc-linux64( 3/ 8), 119.503: ~1 levels ~491520 states ~4633368 transitions
pins2lts-mc-linux64( 3/ 8), 174.638: ~1 levels ~983040 states ~9889576 transitions
pins2lts-mc-linux64( 3/ 8), 288.455: ~1 levels ~1966080 states ~20347080 transitions
pins2lts-mc-linux64( 3/ 8), 514.973: ~1 levels ~3932160 states ~42935200 transitions
pins2lts-mc-linux64( 0/ 8), 621.607: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 621.842:
pins2lts-mc-linux64( 0/ 8), 621.843: mean standard work distribution: 1.0% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 621.843:
pins2lts-mc-linux64( 0/ 8), 621.843: Explored 4752063 states 53474749 transitions, fanout: 11.253
pins2lts-mc-linux64( 0/ 8), 621.843: Total exploration time 619.320 sec (619.070 sec minimum, 619.177 sec on average)
pins2lts-mc-linux64( 0/ 8), 621.843: States per second: 7673, Transitions per second: 86344
pins2lts-mc-linux64( 0/ 8), 621.843:
pins2lts-mc-linux64( 0/ 8), 621.843: Progress states detected: 9263748
pins2lts-mc-linux64( 0/ 8), 621.843: Redundant explorations: -48.7027
pins2lts-mc-linux64( 0/ 8), 621.843:
pins2lts-mc-linux64( 0/ 8), 621.843: Queue width: 8B, total height: 7809977, memory: 59.59MB
pins2lts-mc-linux64( 0/ 8), 621.843: Tree memory: 326.7MB, 37.0 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 621.843: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 621.843: Stored 1429 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 621.843: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 621.843: Est. total memory use: 386.3MB (~1083.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7434809302730570916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X([]((LTLAPp0==true))))||(<>(!(LTLAPp1==true))&&X((X((LTLAPp0==true))&&<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7434809302730570916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X([]((LTLAPp0==true))))||(<>(!(LTLAPp1==true))&&X((X((LTLAPp0==true))&&<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-29 05:10:59] [INFO ] Applying decomposition
[2024-05-29 05:10:59] [INFO ] Flatten gal took : 539 ms
[2024-05-29 05:10:59] [INFO ] Decomposing Gal with order
[2024-05-29 05:10:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:11:00] [INFO ] Removed a total of 400 redundant transitions.
[2024-05-29 05:11:00] [INFO ] Flatten gal took : 291 ms
[2024-05-29 05:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 521 ms.
[2024-05-29 05:11:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality5710292357969153215.gal : 151 ms
[2024-05-29 05:11:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality8149562435454280979.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5710292357969153215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8149562435454280979.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G("((u620.p1177==0)||(u898.p1706==1))"))))||((F(!("((u258.p489==0)||(u930.p1767==1))")))&&(X((X("((u620.p1177==0)||(u898.p17...216
Formula 0 simplified : X(XXF!"((u620.p1177==0)||(u898.p1706==1))" & (G"((u258.p489==0)||(u930.p1767==1))" | X(X!"((u620.p1177==0)||(u898.p1706==1))" | G"((...190
ITS-tools command line returned an error code 137
[2024-05-29 05:19:11] [INFO ] Flatten gal took : 901 ms
[2024-05-29 05:19:14] [INFO ] Input system was already deterministic with 1402 transitions.
[2024-05-29 05:19:14] [INFO ] Transformed 1903 places.
[2024-05-29 05:19:14] [INFO ] Transformed 1402 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 05:19:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality12398334632992271975.gal : 19 ms
[2024-05-29 05:19:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality14227272779137558341.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12398334632992271975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14227272779137558341.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(X(G("((p1177==0)||(p1706==1))"))))||((F(!("((p489==0)||(p1767==1))")))&&(X((X("((p1177==0)||(p1706==1))"))&&(F(!("((p980==0)||...176
Formula 0 simplified : X(XXF!"((p1177==0)||(p1706==1))" & (G"((p489==0)||(p1767==1))" | X(X!"((p1177==0)||(p1706==1))" | G"((p980==0)||(p1292==1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Total runtime 3596982 ms.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15734496 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16023788 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-100A, 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 r373-tall-171683788800212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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