Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679171886454

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 20:38:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:38:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:38:10] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-18 20:38:10] [INFO ] Transformed 1203 places.
[2023-03-18 20:38:10] [INFO ] Transformed 1183 transitions.
[2023-03-18 20:38:10] [INFO ] Found NUPN structural information;
[2023-03-18 20:38:10] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-020B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 1069 transition count 1049
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 1069 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 1068 transition count 1048
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 1068 transition count 1048
Applied a total of 270 rules in 248 ms. Remains 1068 /1203 variables (removed 135) and now considering 1048/1183 (removed 135) transitions.
// Phase 1: matrix 1048 rows 1068 cols
[2023-03-18 20:38:10] [INFO ] Computed 181 place invariants in 41 ms
[2023-03-18 20:38:11] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2023-03-18 20:38:11] [INFO ] Invariant cache hit.
[2023-03-18 20:38:13] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2889 ms to find 0 implicit places.
[2023-03-18 20:38:13] [INFO ] Invariant cache hit.
[2023-03-18 20:38:14] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1068/1203 places, 1048/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3922 ms. Remains : 1068/1203 places, 1048/1183 transitions.
Support contains 44 out of 1068 places after structural reductions.
[2023-03-18 20:38:14] [INFO ] Flatten gal took : 237 ms
[2023-03-18 20:38:15] [INFO ] Flatten gal took : 102 ms
[2023-03-18 20:38:15] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 43 out of 1068 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 31) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 20:38:15] [INFO ] Invariant cache hit.
[2023-03-18 20:38:16] [INFO ] [Real]Absence check using 181 positive place invariants in 45 ms returned sat
[2023-03-18 20:38:18] [INFO ] After 2376ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-18 20:38:19] [INFO ] Deduced a trap composed of 31 places in 1155 ms of which 20 ms to minimize.
[2023-03-18 20:38:22] [INFO ] Deduced a trap composed of 31 places in 2805 ms of which 19 ms to minimize.
[2023-03-18 20:38:23] [INFO ] Deduced a trap composed of 28 places in 625 ms of which 35 ms to minimize.
[2023-03-18 20:38:24] [INFO ] Deduced a trap composed of 18 places in 923 ms of which 2 ms to minimize.
[2023-03-18 20:38:24] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 2 ms to minimize.
[2023-03-18 20:38:25] [INFO ] Deduced a trap composed of 34 places in 978 ms of which 1 ms to minimize.
[2023-03-18 20:38:26] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 1 ms to minimize.
[2023-03-18 20:38:26] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-18 20:38:26] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 1 ms to minimize.
[2023-03-18 20:38:26] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2023-03-18 20:38:27] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 1 ms to minimize.
[2023-03-18 20:38:27] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 0 ms to minimize.
[2023-03-18 20:38:27] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2023-03-18 20:38:27] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2023-03-18 20:38:28] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 2 ms to minimize.
[2023-03-18 20:38:28] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2023-03-18 20:38:28] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:38:28] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2023-03-18 20:38:28] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2023-03-18 20:38:29] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:38:29] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 0 ms to minimize.
[2023-03-18 20:38:29] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 11 ms to minimize.
[2023-03-18 20:38:30] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 1 ms to minimize.
[2023-03-18 20:38:30] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 0 ms to minimize.
[2023-03-18 20:38:30] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 11855 ms
[2023-03-18 20:38:30] [INFO ] After 14302ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:38:30] [INFO ] After 14691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:38:30] [INFO ] [Nat]Absence check using 181 positive place invariants in 122 ms returned sat
[2023-03-18 20:38:31] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:38:31] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 1 ms to minimize.
[2023-03-18 20:38:32] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 1 ms to minimize.
[2023-03-18 20:38:32] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 0 ms to minimize.
[2023-03-18 20:38:32] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 1 ms to minimize.
[2023-03-18 20:38:32] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 0 ms to minimize.
[2023-03-18 20:38:33] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 0 ms to minimize.
[2023-03-18 20:38:33] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 1 ms to minimize.
[2023-03-18 20:38:34] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 1 ms to minimize.
[2023-03-18 20:38:34] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 1 ms to minimize.
[2023-03-18 20:38:34] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 1 ms to minimize.
[2023-03-18 20:38:35] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2023-03-18 20:38:35] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:38:35] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2023-03-18 20:38:35] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 0 ms to minimize.
[2023-03-18 20:38:36] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 0 ms to minimize.
[2023-03-18 20:38:36] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 1 ms to minimize.
[2023-03-18 20:38:36] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 2 ms to minimize.
[2023-03-18 20:38:36] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 0 ms to minimize.
[2023-03-18 20:38:37] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 0 ms to minimize.
[2023-03-18 20:38:37] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2023-03-18 20:38:37] [INFO ] Deduced a trap composed of 35 places in 377 ms of which 0 ms to minimize.
[2023-03-18 20:38:38] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 0 ms to minimize.
[2023-03-18 20:38:38] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:38:38] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 1 ms to minimize.
[2023-03-18 20:38:38] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 0 ms to minimize.
[2023-03-18 20:38:39] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 0 ms to minimize.
[2023-03-18 20:38:39] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2023-03-18 20:38:39] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2023-03-18 20:38:39] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 1 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 13 ms to minimize.
[2023-03-18 20:38:40] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2023-03-18 20:38:41] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 0 ms to minimize.
[2023-03-18 20:38:41] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2023-03-18 20:38:41] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 0 ms to minimize.
[2023-03-18 20:38:41] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 0 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 50 places in 368 ms of which 1 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2023-03-18 20:38:42] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2023-03-18 20:38:43] [INFO ] Deduced a trap composed of 40 places in 485 ms of which 1 ms to minimize.
[2023-03-18 20:38:44] [INFO ] Deduced a trap composed of 35 places in 924 ms of which 1 ms to minimize.
[2023-03-18 20:38:44] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 32 ms to minimize.
[2023-03-18 20:38:44] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 21 ms to minimize.
[2023-03-18 20:38:45] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 0 ms to minimize.
[2023-03-18 20:38:45] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 0 ms to minimize.
[2023-03-18 20:38:45] [INFO ] Deduced a trap composed of 51 places in 459 ms of which 0 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 0 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 0 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 0 ms to minimize.
[2023-03-18 20:38:46] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 0 ms to minimize.
[2023-03-18 20:38:47] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 0 ms to minimize.
[2023-03-18 20:38:47] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 0 ms to minimize.
[2023-03-18 20:38:47] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2023-03-18 20:38:47] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2023-03-18 20:38:47] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 0 ms to minimize.
[2023-03-18 20:38:47] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 1 ms to minimize.
[2023-03-18 20:38:48] [INFO ] Deduced a trap composed of 42 places in 504 ms of which 1 ms to minimize.
[2023-03-18 20:38:48] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 17082 ms
[2023-03-18 20:38:51] [INFO ] Deduced a trap composed of 21 places in 2865 ms of which 2 ms to minimize.
[2023-03-18 20:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2968 ms
[2023-03-18 20:38:51] [INFO ] After 20842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-18 20:38:52] [INFO ] After 21622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 8 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1068 transition count 948
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 968 transition count 847
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 867 transition count 847
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 407 place count 862 transition count 842
Iterating global reduction 2 with 5 rules applied. Total rules applied 412 place count 862 transition count 842
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 412 place count 862 transition count 838
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 420 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 2 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1130 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 133 times.
Drop transitions removed 133 transitions
Iterating global reduction 2 with 133 rules applied. Total rules applied 1263 place count 503 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1264 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1265 place count 501 transition count 482
Applied a total of 1265 rules in 220 ms. Remains 501 /1068 variables (removed 567) and now considering 482/1048 (removed 566) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 501/1068 places, 482/1048 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 482 rows 501 cols
[2023-03-18 20:38:52] [INFO ] Computed 180 place invariants in 11 ms
[2023-03-18 20:38:53] [INFO ] [Real]Absence check using 175 positive place invariants in 612 ms returned sat
[2023-03-18 20:38:53] [INFO ] [Real]Absence check using 175 positive and 5 generalized place invariants in 15 ms returned sat
[2023-03-18 20:38:53] [INFO ] After 1269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:38:53] [INFO ] [Nat]Absence check using 175 positive place invariants in 35 ms returned sat
[2023-03-18 20:38:53] [INFO ] [Nat]Absence check using 175 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-18 20:38:54] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:38:54] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2023-03-18 20:38:54] [INFO ] Deduced a trap composed of 11 places in 527 ms of which 1 ms to minimize.
[2023-03-18 20:38:55] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2023-03-18 20:38:55] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-18 20:38:55] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-18 20:38:56] [INFO ] Deduced a trap composed of 8 places in 657 ms of which 0 ms to minimize.
[2023-03-18 20:38:56] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-18 20:38:56] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-18 20:38:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-18 20:38:56] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-18 20:38:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2486 ms
[2023-03-18 20:38:56] [INFO ] After 2725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-18 20:38:56] [INFO ] After 2897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 482/482 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 500 transition count 481
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 500 transition count 481
Applied a total of 4 rules in 45 ms. Remains 500 /501 variables (removed 1) and now considering 481/482 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 500/501 places, 481/482 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 298456 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298456 steps, saw 171940 distinct states, run finished after 3008 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 481 rows 500 cols
[2023-03-18 20:38:59] [INFO ] Computed 180 place invariants in 7 ms
[2023-03-18 20:38:59] [INFO ] [Real]Absence check using 177 positive place invariants in 25 ms returned sat
[2023-03-18 20:38:59] [INFO ] [Real]Absence check using 177 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-18 20:39:00] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:39:00] [INFO ] [Nat]Absence check using 177 positive place invariants in 53 ms returned sat
[2023-03-18 20:39:00] [INFO ] [Nat]Absence check using 177 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:39:00] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2023-03-18 20:39:00] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2023-03-18 20:39:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 324 ms
[2023-03-18 20:39:01] [INFO ] After 763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 20:39:01] [INFO ] After 1007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 24 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 500/500 places, 481/481 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-18 20:39:01] [INFO ] Invariant cache hit.
[2023-03-18 20:39:01] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-18 20:39:01] [INFO ] Invariant cache hit.
[2023-03-18 20:39:02] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
[2023-03-18 20:39:02] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-18 20:39:02] [INFO ] Invariant cache hit.
[2023-03-18 20:39:02] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1479 ms. Remains : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 20:39:02] [INFO ] Invariant cache hit.
[2023-03-18 20:39:02] [INFO ] [Real]Absence check using 177 positive place invariants in 85 ms returned sat
[2023-03-18 20:39:02] [INFO ] [Real]Absence check using 177 positive and 3 generalized place invariants in 25 ms returned sat
[2023-03-18 20:39:03] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:39:03] [INFO ] [Nat]Absence check using 177 positive place invariants in 32 ms returned sat
[2023-03-18 20:39:03] [INFO ] [Nat]Absence check using 177 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-18 20:39:03] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:03] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-18 20:39:03] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldIIPs-PT-020B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 244 stabilizing places and 244 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 51 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-18 20:39:04] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-18 20:39:04] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-18 20:39:04] [INFO ] Invariant cache hit.
[2023-03-18 20:39:05] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
[2023-03-18 20:39:05] [INFO ] Invariant cache hit.
[2023-03-18 20:39:06] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1991 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s562 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 849 ms.
Product exploration explored 100000 steps with 50000 reset in 814 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-00 finished in 4191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U G(p1))&&(p0||G(p2)))) U p1)))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1043
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1043
Applied a total of 10 rules in 85 ms. Remains 1063 /1068 variables (removed 5) and now considering 1043/1048 (removed 5) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-18 20:39:08] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-18 20:39:08] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-18 20:39:08] [INFO ] Invariant cache hit.
[2023-03-18 20:39:09] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
[2023-03-18 20:39:09] [INFO ] Invariant cache hit.
[2023-03-18 20:39:10] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1068 places, 1043/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2495 ms. Remains : 1063/1068 places, 1043/1048 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (NOT p1), true, (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s1042 1), p0:(EQ s330 1), p2:(EQ s283 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-01 finished in 2832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(X(!p0)) U ((X(X(!p0))&&G(!p1))||X(X(G(!p0))))))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 967 transition count 846
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 866 transition count 846
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 860 transition count 840
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 414 place count 860 transition count 836
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 856 transition count 836
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1120 place count 507 transition count 487
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1122 place count 505 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 504 transition count 485
Applied a total of 1123 rules in 172 ms. Remains 504 /1068 variables (removed 564) and now considering 485/1048 (removed 563) transitions.
// Phase 1: matrix 485 rows 504 cols
[2023-03-18 20:39:11] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:39:11] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-18 20:39:11] [INFO ] Invariant cache hit.
[2023-03-18 20:39:12] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2023-03-18 20:39:12] [INFO ] Redundant transitions in 79 ms returned [484]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 484 rows 504 cols
[2023-03-18 20:39:12] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:39:12] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1068 places, 484/1048 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1964 ms. Remains : 504/1068 places, 484/1048 transitions.
Stuttering acceptance computed with spot in 448 ms :[false, false, false, false, false, false]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=1 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 2}], [{ cond=(AND p1 p0), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p1:(AND (EQ s31 1) (EQ s43 1)), p0:(AND (EQ s366 1) (EQ s388 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 220 reset in 595 ms.
Product exploration explored 100000 steps with 220 reset in 681 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 627 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 479 ms :[false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:39:16] [INFO ] Invariant cache hit.
[2023-03-18 20:39:16] [INFO ] [Real]Absence check using 180 positive place invariants in 40 ms returned sat
[2023-03-18 20:39:16] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:39:16] [INFO ] [Nat]Absence check using 180 positive place invariants in 108 ms returned sat
[2023-03-18 20:39:16] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:16] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-18 20:39:16] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 484/484 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 504 transition count 484
Applied a total of 117 rules in 44 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 504/504 places, 484/484 transitions.
Finished random walk after 934 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=84 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 875 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 442 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 398 ms :[false, false, false, false, false, false]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 484/484 transitions.
Applied a total of 0 rules in 36 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2023-03-18 20:39:18] [INFO ] Invariant cache hit.
[2023-03-18 20:39:19] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-18 20:39:19] [INFO ] Invariant cache hit.
[2023-03-18 20:39:19] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2023-03-18 20:39:19] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-18 20:39:19] [INFO ] Invariant cache hit.
[2023-03-18 20:39:20] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1364 ms. Remains : 504/504 places, 484/484 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 493 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 435 ms :[false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:39:21] [INFO ] Invariant cache hit.
[2023-03-18 20:39:21] [INFO ] [Real]Absence check using 180 positive place invariants in 42 ms returned sat
[2023-03-18 20:39:21] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:39:21] [INFO ] [Nat]Absence check using 180 positive place invariants in 28 ms returned sat
[2023-03-18 20:39:22] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:39:22] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-18 20:39:22] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 484/484 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 504 transition count 484
Applied a total of 117 rules in 34 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 504/504 places, 484/484 transitions.
Finished random walk after 3036 steps, including 1 resets, run visited all 1 properties in 19 ms. (steps per millisecond=159 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 723 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 386 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 464 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 348 ms :[false, false, false, false, false, false]
Product exploration explored 100000 steps with 216 reset in 591 ms.
Product exploration explored 100000 steps with 223 reset in 650 ms.
Built C files in :
/tmp/ltsmin14392942389358519739
[2023-03-18 20:39:25] [INFO ] Computing symmetric may disable matrix : 484 transitions.
[2023-03-18 20:39:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:39:25] [INFO ] Computing symmetric may enable matrix : 484 transitions.
[2023-03-18 20:39:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:39:25] [INFO ] Computing Do-Not-Accords matrix : 484 transitions.
[2023-03-18 20:39:25] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:39:25] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14392942389358519739
Running compilation step : cd /tmp/ltsmin14392942389358519739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1314 ms.
Running link step : cd /tmp/ltsmin14392942389358519739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin14392942389358519739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13064069993488289385.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 484/484 transitions.
Applied a total of 0 rules in 31 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2023-03-18 20:39:40] [INFO ] Invariant cache hit.
[2023-03-18 20:39:41] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-18 20:39:41] [INFO ] Invariant cache hit.
[2023-03-18 20:39:41] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2023-03-18 20:39:41] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-18 20:39:41] [INFO ] Invariant cache hit.
[2023-03-18 20:39:42] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1542 ms. Remains : 504/504 places, 484/484 transitions.
Built C files in :
/tmp/ltsmin1396504064301360206
[2023-03-18 20:39:43] [INFO ] Computing symmetric may disable matrix : 484 transitions.
[2023-03-18 20:39:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:39:43] [INFO ] Computing symmetric may enable matrix : 484 transitions.
[2023-03-18 20:39:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:39:43] [INFO ] Computing Do-Not-Accords matrix : 484 transitions.
[2023-03-18 20:39:43] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:39:43] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1396504064301360206
Running compilation step : cd /tmp/ltsmin1396504064301360206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1087 ms.
Running link step : cd /tmp/ltsmin1396504064301360206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin1396504064301360206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3086346785330070100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:39:58] [INFO ] Flatten gal took : 25 ms
[2023-03-18 20:39:58] [INFO ] Flatten gal took : 24 ms
[2023-03-18 20:39:58] [INFO ] Time to serialize gal into /tmp/LTL15859986597097441393.gal : 5 ms
[2023-03-18 20:39:58] [INFO ] Time to serialize properties into /tmp/LTL7266295869818774256.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15859986597097441393.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2932886130414016497.hoa' '-atoms' '/tmp/LTL7266295869818774256.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7266295869818774256.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2932886130414016497.hoa
Detected timeout of ITS tools.
[2023-03-18 20:40:13] [INFO ] Flatten gal took : 29 ms
[2023-03-18 20:40:13] [INFO ] Flatten gal took : 25 ms
[2023-03-18 20:40:13] [INFO ] Time to serialize gal into /tmp/LTL10821855910546975158.gal : 4 ms
[2023-03-18 20:40:13] [INFO ] Time to serialize properties into /tmp/LTL15295560113573599865.ltl : 10 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10821855910546975158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15295560113573599865.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((p875==1)&&(p926==1))"))||((X(X(!("((p875==1)&&(p926==1))"))))U((X(X(G(!("((p875==1)&&(p926==1))")))))||((X(X(!("((p875==1)&...210
Formula 0 simplified : G(F!"((p875==1)&&(p926==1))" & (XX"((p875==1)&&(p926==1))" R (XXF"((p875==1)&&(p926==1))" & (XX"((p875==1)&&(p926==1))" | F"((p96==1...173
Detected timeout of ITS tools.
[2023-03-18 20:40:28] [INFO ] Flatten gal took : 48 ms
[2023-03-18 20:40:28] [INFO ] Applying decomposition
[2023-03-18 20:40:28] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11539939162939880835.txt' '-o' '/tmp/graph11539939162939880835.bin' '-w' '/tmp/graph11539939162939880835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11539939162939880835.bin' '-l' '-1' '-v' '-w' '/tmp/graph11539939162939880835.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:40:29] [INFO ] Decomposing Gal with order
[2023-03-18 20:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:40:29] [INFO ] Removed a total of 318 redundant transitions.
[2023-03-18 20:40:29] [INFO ] Flatten gal took : 73 ms
[2023-03-18 20:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 13 ms.
[2023-03-18 20:40:29] [INFO ] Time to serialize gal into /tmp/LTL14628387195550764854.gal : 8 ms
[2023-03-18 20:40:29] [INFO ] Time to serialize properties into /tmp/LTL7071119901689534605.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14628387195550764854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7071119901689534605.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i14.i1.u134.p875==1)&&(i15.u141.p926==1))"))||((X(X(!("((i14.i1.u134.p875==1)&&(i15.u141.p926==1))"))))U((X(X(G(!("((i14.i1...314
Formula 0 simplified : G(F!"((i14.i1.u134.p875==1)&&(i15.u141.p926==1))" & (XX"((i14.i1.u134.p875==1)&&(i15.u141.p926==1))" R (XXF"((i14.i1.u134.p875==1)&&...277
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1039285864339324326
[2023-03-18 20:40:44] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1039285864339324326
Running compilation step : cd /tmp/ltsmin1039285864339324326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 824 ms.
Running link step : cd /tmp/ltsmin1039285864339324326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1039285864339324326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(X(X(!(LTLAPp0==true))) U (X(X([](!(LTLAPp0==true))))||(X(X(!(LTLAPp0==true)))&&[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-02 finished in 108463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 967 transition count 847
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 867 transition count 847
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 405 place count 862 transition count 842
Iterating global reduction 2 with 5 rules applied. Total rules applied 410 place count 862 transition count 842
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 410 place count 862 transition count 838
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 418 place count 858 transition count 838
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1126 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1128 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 501 transition count 482
Applied a total of 1129 rules in 119 ms. Remains 501 /1068 variables (removed 567) and now considering 482/1048 (removed 566) transitions.
// Phase 1: matrix 482 rows 501 cols
[2023-03-18 20:40:59] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:40:59] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-18 20:40:59] [INFO ] Invariant cache hit.
[2023-03-18 20:41:00] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2023-03-18 20:41:00] [INFO ] Redundant transitions in 77 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-18 20:41:00] [INFO ] Computed 180 place invariants in 4 ms
[2023-03-18 20:41:00] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1068 places, 481/1048 transitions.
Applied a total of 0 rules in 19 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1185 ms. Remains : 501/1068 places, 481/1048 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-04 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:(AND (EQ s88 1) (EQ s97 1) (EQ s103 1)), p1:(EQ s67 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 128 reset in 604 ms.
Product exploration explored 100000 steps with 129 reset in 618 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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 342 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 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 823 steps, including 0 resets, run visited all 2 properties in 27 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 386 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 20:41:03] [INFO ] Invariant cache hit.
[2023-03-18 20:41:03] [INFO ] [Real]Absence check using 180 positive place invariants in 214 ms returned sat
[2023-03-18 20:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:04] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-18 20:41:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:41:04] [INFO ] [Nat]Absence check using 180 positive place invariants in 51 ms returned sat
[2023-03-18 20:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:05] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-18 20:41:05] [INFO ] Computed and/alt/rep : 479/1192/479 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-18 20:41:11] [INFO ] Added : 436 causal constraints over 88 iterations in 6599 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 18 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-18 20:41:11] [INFO ] Invariant cache hit.
[2023-03-18 20:41:12] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-18 20:41:12] [INFO ] Invariant cache hit.
[2023-03-18 20:41:13] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2023-03-18 20:41:13] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-18 20:41:13] [INFO ] Invariant cache hit.
[2023-03-18 20:41:13] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1792 ms. Remains : 501/501 places, 481/481 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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 281 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 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1016 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 347 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 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 20:41:14] [INFO ] Invariant cache hit.
[2023-03-18 20:41:15] [INFO ] [Real]Absence check using 180 positive place invariants in 119 ms returned sat
[2023-03-18 20:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:15] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-18 20:41:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:41:16] [INFO ] [Nat]Absence check using 180 positive place invariants in 61 ms returned sat
[2023-03-18 20:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:16] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2023-03-18 20:41:16] [INFO ] Computed and/alt/rep : 479/1192/479 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-18 20:41:23] [INFO ] Added : 436 causal constraints over 88 iterations in 6455 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 129 reset in 601 ms.
Product exploration explored 100000 steps with 129 reset in 577 ms.
Built C files in :
/tmp/ltsmin1819035603593021477
[2023-03-18 20:41:24] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2023-03-18 20:41:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:24] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2023-03-18 20:41:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:24] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2023-03-18 20:41:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:24] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1819035603593021477
Running compilation step : cd /tmp/ltsmin1819035603593021477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1183 ms.
Running link step : cd /tmp/ltsmin1819035603593021477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1819035603593021477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11234131458520364437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 24 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-18 20:41:39] [INFO ] Invariant cache hit.
[2023-03-18 20:41:40] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-18 20:41:40] [INFO ] Invariant cache hit.
[2023-03-18 20:41:40] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2023-03-18 20:41:40] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-18 20:41:40] [INFO ] Invariant cache hit.
[2023-03-18 20:41:41] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2080 ms. Remains : 501/501 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin6926978811380156603
[2023-03-18 20:41:41] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2023-03-18 20:41:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:41] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2023-03-18 20:41:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:41] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2023-03-18 20:41:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:41] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6926978811380156603
Running compilation step : cd /tmp/ltsmin6926978811380156603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1032 ms.
Running link step : cd /tmp/ltsmin6926978811380156603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin6926978811380156603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11943474360121419555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:41:56] [INFO ] Flatten gal took : 23 ms
[2023-03-18 20:41:56] [INFO ] Flatten gal took : 20 ms
[2023-03-18 20:41:56] [INFO ] Time to serialize gal into /tmp/LTL3000214447807639907.gal : 4 ms
[2023-03-18 20:41:56] [INFO ] Time to serialize properties into /tmp/LTL894493191395906239.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3000214447807639907.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15600586666556811529.hoa' '-atoms' '/tmp/LTL894493191395906239.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL894493191395906239.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15600586666556811529.hoa
Detected timeout of ITS tools.
[2023-03-18 20:42:12] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:42:12] [INFO ] Flatten gal took : 18 ms
[2023-03-18 20:42:12] [INFO ] Time to serialize gal into /tmp/LTL14945189628134493351.gal : 4 ms
[2023-03-18 20:42:12] [INFO ] Time to serialize properties into /tmp/LTL10058867733673024070.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14945189628134493351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10058867733673024070.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(p176==1)"))||("(((p223==1)&&(p242==1))&&(p256==1))")))))
Formula 0 simplified : G(F!"(((p223==1)&&(p242==1))&&(p256==1))" & FG!"(p176==1)")
Detected timeout of ITS tools.
[2023-03-18 20:42:27] [INFO ] Flatten gal took : 49 ms
[2023-03-18 20:42:27] [INFO ] Applying decomposition
[2023-03-18 20:42:27] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3294285671577263620.txt' '-o' '/tmp/graph3294285671577263620.bin' '-w' '/tmp/graph3294285671577263620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3294285671577263620.bin' '-l' '-1' '-v' '-w' '/tmp/graph3294285671577263620.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:42:27] [INFO ] Decomposing Gal with order
[2023-03-18 20:42:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:42:27] [INFO ] Removed a total of 318 redundant transitions.
[2023-03-18 20:42:27] [INFO ] Flatten gal took : 41 ms
[2023-03-18 20:42:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 7 ms.
[2023-03-18 20:42:27] [INFO ] Time to serialize gal into /tmp/LTL8780081594225263823.gal : 5 ms
[2023-03-18 20:42:27] [INFO ] Time to serialize properties into /tmp/LTL9803641376411467360.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8780081594225263823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9803641376411467360.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(i2.i0.u25.p176==1)"))||("(((i3.i2.u32.p223==1)&&(i3.i2.u35.p242==1))&&(i3.i2.u36.p256==1))")))))
Formula 0 simplified : G(F!"(((i3.i2.u32.p223==1)&&(i3.i2.u35.p242==1))&&(i3.i2.u36.p256==1))" & FG!"(i2.i0.u25.p176==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14522948606637190977
[2023-03-18 20:42:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14522948606637190977
Running compilation step : cd /tmp/ltsmin14522948606637190977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 833 ms.
Running link step : cd /tmp/ltsmin14522948606637190977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14522948606637190977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-04 finished in 118181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 859 transition count 839
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 416 place count 859 transition count 835
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 424 place count 855 transition count 835
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1130 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 499 transition count 480
Applied a total of 1133 rules in 167 ms. Remains 499 /1068 variables (removed 569) and now considering 480/1048 (removed 568) transitions.
// Phase 1: matrix 480 rows 499 cols
[2023-03-18 20:42:57] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-18 20:42:58] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-18 20:42:58] [INFO ] Invariant cache hit.
[2023-03-18 20:42:58] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2023-03-18 20:42:58] [INFO ] Redundant transitions in 107 ms returned [479]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 479 rows 499 cols
[2023-03-18 20:42:58] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-18 20:42:59] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1068 places, 479/1048 transitions.
Applied a total of 0 rules in 8 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1623 ms. Remains : 499/1068 places, 479/1048 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s300 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1042 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-05 finished in 1706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(p1))))))'
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 48 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-18 20:42:59] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-18 20:42:59] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-18 20:42:59] [INFO ] Invariant cache hit.
[2023-03-18 20:43:00] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
[2023-03-18 20:43:00] [INFO ] Invariant cache hit.
[2023-03-18 20:43:01] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2251 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s256 0), p0:(EQ s686 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 511 ms.
Product exploration explored 100000 steps with 25000 reset in 423 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 303 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1511 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 1064 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 36 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
[2023-03-18 20:43:04] [INFO ] Invariant cache hit.
[2023-03-18 20:43:04] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-18 20:43:04] [INFO ] Invariant cache hit.
[2023-03-18 20:43:06] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
[2023-03-18 20:43:06] [INFO ] Invariant cache hit.
[2023-03-18 20:43:06] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2562 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1753 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=134 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 486 ms.
Product exploration explored 100000 steps with 25000 reset in 466 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 1044
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 100 place count 1064 transition count 1048
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 142 place count 1064 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 1063 transition count 1047
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 1063 transition count 1047
Performed 419 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 561 places in 0 ms
Iterating global reduction 1 with 419 rules applied. Total rules applied 563 place count 1063 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 703 place count 923 transition count 907
Deduced a syphon composed of 421 places in 0 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 843 place count 923 transition count 907
Deduced a syphon composed of 421 places in 1 ms
Applied a total of 843 rules in 359 ms. Remains 923 /1064 variables (removed 141) and now considering 907/1044 (removed 137) transitions.
[2023-03-18 20:43:10] [INFO ] Redundant transitions in 204 ms returned [906]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 906 rows 923 cols
[2023-03-18 20:43:10] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-18 20:43:11] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1064 places, 906/1044 transitions.
Deduced a syphon composed of 421 places in 1 ms
Applied a total of 0 rules in 48 ms. Remains 923 /923 variables (removed 0) and now considering 906/906 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1190 ms. Remains : 923/1064 places, 906/1044 transitions.
Built C files in :
/tmp/ltsmin9519845338348828312
[2023-03-18 20:43:11] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9519845338348828312
Running compilation step : cd /tmp/ltsmin9519845338348828312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2228 ms.
Running link step : cd /tmp/ltsmin9519845338348828312;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9519845338348828312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1474015289332040178.hoa' '--buchi-type=spotba'
LTSmin run took 2303 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-020B-LTLFireability-06 finished in 16555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(p1))||(!p2 U (p3||G(!p2))))))'
Support contains 6 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1043
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1043
Applied a total of 10 rules in 52 ms. Remains 1063 /1068 variables (removed 5) and now considering 1043/1048 (removed 5) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-18 20:43:15] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-18 20:43:16] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-18 20:43:16] [INFO ] Invariant cache hit.
[2023-03-18 20:43:17] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2023-03-18 20:43:17] [INFO ] Invariant cache hit.
[2023-03-18 20:43:18] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1068 places, 1043/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2277 ms. Remains : 1063/1068 places, 1043/1048 transitions.
Stuttering acceptance computed with spot in 362 ms :[(NOT p1), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=1, aps=[p1:(AND (EQ s850 1) (EQ s159 1)), p3:(AND (NOT (AND (EQ s760 1) (EQ s797 1))) (NOT (AND (EQ s300 1) (EQ s325 1)))), p2:(AND (EQ s300 1) (EQ s325 1)), p0:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 849 ms.
Product exploration explored 100000 steps with 50000 reset in 773 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-07 finished in 4522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F((p0||G(p1))))||G(p2)))))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 89 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-18 20:43:20] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-18 20:43:20] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-18 20:43:20] [INFO ] Invariant cache hit.
[2023-03-18 20:43:22] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
[2023-03-18 20:43:22] [INFO ] Invariant cache hit.
[2023-03-18 20:43:22] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2489 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(EQ s594 1), p1:(EQ s531 1), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 286 reset in 449 ms.
Product exploration explored 100000 steps with 284 reset in 381 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 723 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 346 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-18 20:43:25] [INFO ] Invariant cache hit.
[2023-03-18 20:43:25] [INFO ] [Real]Absence check using 181 positive place invariants in 110 ms returned sat
[2023-03-18 20:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:43:28] [INFO ] [Real]Absence check using state equation in 3047 ms returned sat
[2023-03-18 20:43:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:43:29] [INFO ] [Nat]Absence check using 181 positive place invariants in 125 ms returned sat
[2023-03-18 20:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:43:32] [INFO ] [Nat]Absence check using state equation in 2739 ms returned sat
[2023-03-18 20:43:32] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-03-18 20:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-18 20:43:32] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 99 ms.
[2023-03-18 20:43:44] [INFO ] Deduced a trap composed of 10 places in 471 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:43:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p0))
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 1062 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 : 1062/1062 places, 1042/1042 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1061 transition count 942
Reduce places removed 99 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 100 rules applied. Total rules applied 199 place count 962 transition count 941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 961 transition count 941
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 200 place count 961 transition count 841
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 400 place count 861 transition count 841
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 3 with 710 rules applied. Total rules applied 1110 place count 506 transition count 486
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1112 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1113 place count 503 transition count 484
Applied a total of 1113 rules in 136 ms. Remains 503 /1062 variables (removed 559) and now considering 484/1042 (removed 558) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-18 20:43:44] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:43:44] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-18 20:43:44] [INFO ] Invariant cache hit.
[2023-03-18 20:43:45] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-18 20:43:45] [INFO ] Redundant transitions in 99 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-18 20:43:45] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:43:45] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1062 places, 483/1042 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1422 ms. Remains : 503/1062 places, 483/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 347 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 482 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-18 20:43:47] [INFO ] Invariant cache hit.
[2023-03-18 20:43:48] [INFO ] [Real]Absence check using 180 positive place invariants in 97 ms returned sat
[2023-03-18 20:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:43:48] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2023-03-18 20:43:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:43:48] [INFO ] [Nat]Absence check using 180 positive place invariants in 51 ms returned sat
[2023-03-18 20:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:43:49] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2023-03-18 20:43:49] [INFO ] Computed and/alt/rep : 479/1221/479 causal constraints (skipped 1 transitions) in 63 ms.
[2023-03-18 20:44:02] [INFO ] Added : 479 causal constraints over 96 iterations in 13014 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering criterion allowed to conclude after 1114 steps with 3 reset in 6 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-08 finished in 42394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 967 transition count 846
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 866 transition count 846
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 407 place count 861 transition count 841
Iterating global reduction 2 with 5 rules applied. Total rules applied 412 place count 861 transition count 841
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 412 place count 861 transition count 838
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 858 transition count 838
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1126 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1128 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 501 transition count 482
Applied a total of 1129 rules in 134 ms. Remains 501 /1068 variables (removed 567) and now considering 482/1048 (removed 566) transitions.
// Phase 1: matrix 482 rows 501 cols
[2023-03-18 20:44:02] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-18 20:44:03] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-18 20:44:03] [INFO ] Invariant cache hit.
[2023-03-18 20:44:03] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-03-18 20:44:03] [INFO ] Redundant transitions in 100 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-18 20:44:03] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-18 20:44:04] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1068 places, 481/1048 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1451 ms. Remains : 501/1068 places, 481/1048 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-09 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:(EQ s424 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1012 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-09 finished in 1595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&G(p1)))))'
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 94 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-18 20:44:04] [INFO ] Computed 181 place invariants in 19 ms
[2023-03-18 20:44:05] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-18 20:44:05] [INFO ] Invariant cache hit.
[2023-03-18 20:44:06] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2023-03-18 20:44:06] [INFO ] Invariant cache hit.
[2023-03-18 20:44:06] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2512 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(NEQ s649 1), p0:(NEQ s953 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13221 steps with 5 reset in 77 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-12 finished in 3005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 79 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
[2023-03-18 20:44:07] [INFO ] Invariant cache hit.
[2023-03-18 20:44:08] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-18 20:44:08] [INFO ] Invariant cache hit.
[2023-03-18 20:44:09] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2023-03-18 20:44:09] [INFO ] Invariant cache hit.
[2023-03-18 20:44:10] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2603 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s823 1) (EQ s831 1) (EQ s852 1) (EQ s971 1)), p1:(EQ s971 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 233 reset in 455 ms.
Product exploration explored 100000 steps with 227 reset in 471 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 267 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 20:44:12] [INFO ] Invariant cache hit.
[2023-03-18 20:44:12] [INFO ] [Real]Absence check using 181 positive place invariants in 118 ms returned sat
[2023-03-18 20:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:44:15] [INFO ] [Real]Absence check using state equation in 2777 ms returned sat
[2023-03-18 20:44:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:44:16] [INFO ] [Nat]Absence check using 181 positive place invariants in 169 ms returned sat
[2023-03-18 20:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:44:19] [INFO ] [Nat]Absence check using state equation in 3516 ms returned sat
[2023-03-18 20:44:20] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-18 20:44:31] [INFO ] Deduced a trap composed of 10 places in 404 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:44:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 28 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2023-03-18 20:44:31] [INFO ] Invariant cache hit.
[2023-03-18 20:44:31] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-18 20:44:31] [INFO ] Invariant cache hit.
[2023-03-18 20:44:32] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2023-03-18 20:44:33] [INFO ] Invariant cache hit.
[2023-03-18 20:44:33] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2506 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 602 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 20:44:34] [INFO ] Invariant cache hit.
[2023-03-18 20:44:35] [INFO ] [Real]Absence check using 181 positive place invariants in 129 ms returned sat
[2023-03-18 20:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:44:37] [INFO ] [Real]Absence check using state equation in 2580 ms returned sat
[2023-03-18 20:44:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:44:38] [INFO ] [Nat]Absence check using 181 positive place invariants in 138 ms returned sat
[2023-03-18 20:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:44:41] [INFO ] [Nat]Absence check using state equation in 2786 ms returned sat
[2023-03-18 20:44:41] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 124 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:44:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 227 reset in 466 ms.
Product exploration explored 100000 steps with 238 reset in 439 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 99 place count 1062 transition count 1044
Deduced a syphon composed of 140 places in 2 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 140 place count 1062 transition count 1044
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 0 ms
Iterating global reduction 1 with 420 rules applied. Total rules applied 560 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 701 place count 921 transition count 903
Deduced a syphon composed of 419 places in 0 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 842 place count 921 transition count 903
Deduced a syphon composed of 419 places in 0 ms
Applied a total of 842 rules in 264 ms. Remains 921 /1062 variables (removed 141) and now considering 903/1042 (removed 139) transitions.
[2023-03-18 20:44:54] [INFO ] Redundant transitions in 124 ms returned [902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 902 rows 921 cols
[2023-03-18 20:44:54] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-18 20:44:55] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1062 places, 902/1042 transitions.
Deduced a syphon composed of 419 places in 1 ms
Applied a total of 0 rules in 43 ms. Remains 921 /921 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 915 ms. Remains : 921/1062 places, 902/1042 transitions.
Built C files in :
/tmp/ltsmin6439715732431060526
[2023-03-18 20:44:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6439715732431060526
Running compilation step : cd /tmp/ltsmin6439715732431060526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1675 ms.
Running link step : cd /tmp/ltsmin6439715732431060526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6439715732431060526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13772136071038632495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 27 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-18 20:45:10] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-18 20:45:10] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-18 20:45:10] [INFO ] Invariant cache hit.
[2023-03-18 20:45:11] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2023-03-18 20:45:11] [INFO ] Invariant cache hit.
[2023-03-18 20:45:12] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2458 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Built C files in :
/tmp/ltsmin1282269477070377343
[2023-03-18 20:45:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1282269477070377343
Running compilation step : cd /tmp/ltsmin1282269477070377343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1709 ms.
Running link step : cd /tmp/ltsmin1282269477070377343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1282269477070377343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14945254374595026932.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:45:27] [INFO ] Flatten gal took : 28 ms
[2023-03-18 20:45:27] [INFO ] Flatten gal took : 27 ms
[2023-03-18 20:45:27] [INFO ] Time to serialize gal into /tmp/LTL11641514537198064260.gal : 4 ms
[2023-03-18 20:45:27] [INFO ] Time to serialize properties into /tmp/LTL7760272936762911003.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11641514537198064260.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13507583591836640563.hoa' '-atoms' '/tmp/LTL7760272936762911003.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7760272936762911003.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13507583591836640563.hoa
Detected timeout of ITS tools.
[2023-03-18 20:45:42] [INFO ] Flatten gal took : 34 ms
[2023-03-18 20:45:42] [INFO ] Flatten gal took : 27 ms
[2023-03-18 20:45:42] [INFO ] Time to serialize gal into /tmp/LTL4680420903167253187.gal : 19 ms
[2023-03-18 20:45:42] [INFO ] Time to serialize properties into /tmp/LTL2911876670866581393.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4680420903167253187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2911876670866581393.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p1097==1)"))||("(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))")))))
Formula 0 simplified : XG(!"(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))" & X!"(p1097==1)")
Detected timeout of ITS tools.
[2023-03-18 20:45:58] [INFO ] Flatten gal took : 52 ms
[2023-03-18 20:45:58] [INFO ] Applying decomposition
[2023-03-18 20:45:58] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8337227250537549529.txt' '-o' '/tmp/graph8337227250537549529.bin' '-w' '/tmp/graph8337227250537549529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8337227250537549529.bin' '-l' '-1' '-v' '-w' '/tmp/graph8337227250537549529.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:45:58] [INFO ] Decomposing Gal with order
[2023-03-18 20:45:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:45:58] [INFO ] Removed a total of 460 redundant transitions.
[2023-03-18 20:45:58] [INFO ] Flatten gal took : 155 ms
[2023-03-18 20:45:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-18 20:45:58] [INFO ] Time to serialize gal into /tmp/LTL8480776276503079386.gal : 25 ms
[2023-03-18 20:45:58] [INFO ] Time to serialize properties into /tmp/LTL1477662004879352113.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8480776276503079386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1477662004879352113.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i18.i3.u367.p1097==1)"))||("(((i15.i1.u312.p928==1)&&(i15.i1.u315.p936==1))&&((i15.i3.u322.p963==1)&&(i18.i3.u367.p1097==1...164
Formula 0 simplified : XG(!"(((i15.i1.u312.p928==1)&&(i15.i1.u315.p936==1))&&((i15.i3.u322.p963==1)&&(i18.i3.u367.p1097==1)))" & X!"(i18.i3.u367.p1097==1)"...156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8942620289155146702
[2023-03-18 20:46:13] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8942620289155146702
Running compilation step : cd /tmp/ltsmin8942620289155146702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1695 ms.
Running link step : cd /tmp/ltsmin8942620289155146702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8942620289155146702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-13 finished in 141453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&F(p2))))))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 201 place count 967 transition count 946
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 410 place count 859 transition count 839
Iterating global reduction 3 with 6 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 416 place count 859 transition count 835
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 424 place count 855 transition count 835
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 3 with 698 rules applied. Total rules applied 1122 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1124 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1125 place count 503 transition count 484
Applied a total of 1125 rules in 127 ms. Remains 503 /1068 variables (removed 565) and now considering 484/1048 (removed 564) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-18 20:46:28] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-18 20:46:29] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-18 20:46:29] [INFO ] Invariant cache hit.
[2023-03-18 20:46:29] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-18 20:46:29] [INFO ] Redundant transitions in 83 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-18 20:46:29] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-18 20:46:30] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1068 places, 483/1048 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1190 ms. Remains : 503/1068 places, 483/1048 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s255 0), p0:(AND (EQ s255 0) (EQ s178 1)), p2:(EQ s454 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1356 steps with 5 reset in 14 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-14 finished in 1359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 80 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-18 20:46:30] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-18 20:46:30] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-18 20:46:30] [INFO ] Invariant cache hit.
[2023-03-18 20:46:31] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2023-03-18 20:46:31] [INFO ] Invariant cache hit.
[2023-03-18 20:46:32] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2192 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s615 1) (EQ s623 1) (EQ s644 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2595 steps with 0 reset in 14 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-15 finished in 2351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(X(!p0)) U ((X(X(!p0))&&G(!p1))||X(X(G(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-020B-LTLFireability-13
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 967 transition count 846
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 866 transition count 846
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 860 transition count 840
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 414 place count 860 transition count 836
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 856 transition count 836
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 143 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-18 20:46:33] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-18 20:46:33] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-18 20:46:33] [INFO ] Invariant cache hit.
[2023-03-18 20:46:33] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2023-03-18 20:46:33] [INFO ] Invariant cache hit.
[2023-03-18 20:46:34] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 500/1068 places, 481/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1261 ms. Remains : 500/1068 places, 481/1048 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s385 1) (EQ s390 1) (EQ s401 1) (EQ s455 1)), p1:(EQ s455 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1823 reset in 467 ms.
Product exploration explored 100000 steps with 1798 reset in 528 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 : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 20:46:36] [INFO ] Invariant cache hit.
[2023-03-18 20:46:36] [INFO ] [Real]Absence check using 180 positive place invariants in 157 ms returned sat
[2023-03-18 20:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:46:37] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2023-03-18 20:46:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:46:37] [INFO ] [Nat]Absence check using 180 positive place invariants in 60 ms returned sat
[2023-03-18 20:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:46:38] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-18 20:46:38] [INFO ] Computed and/alt/rep : 480/1193/480 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-18 20:46:44] [INFO ] Added : 389 causal constraints over 79 iterations in 5742 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-18 20:46:44] [INFO ] Invariant cache hit.
[2023-03-18 20:46:44] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-18 20:46:44] [INFO ] Invariant cache hit.
[2023-03-18 20:46:45] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-18 20:46:45] [INFO ] Invariant cache hit.
[2023-03-18 20:46:45] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 500/500 places, 481/481 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 : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 20:46:46] [INFO ] Invariant cache hit.
[2023-03-18 20:46:47] [INFO ] [Real]Absence check using 180 positive place invariants in 64 ms returned sat
[2023-03-18 20:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:46:48] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2023-03-18 20:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:46:49] [INFO ] [Nat]Absence check using 180 positive place invariants in 298 ms returned sat
[2023-03-18 20:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:46:49] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2023-03-18 20:46:49] [INFO ] Computed and/alt/rep : 480/1193/480 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-18 20:46:55] [INFO ] Added : 389 causal constraints over 79 iterations in 5763 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1804 reset in 494 ms.
Product exploration explored 100000 steps with 1790 reset in 548 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-18 20:46:57] [INFO ] Redundant transitions in 553 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-18 20:46:57] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:46:58] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1173 ms. Remains : 500/500 places, 480/481 transitions.
Built C files in :
/tmp/ltsmin12813600501681158812
[2023-03-18 20:46:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12813600501681158812
Running compilation step : cd /tmp/ltsmin12813600501681158812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 901 ms.
Running link step : cd /tmp/ltsmin12813600501681158812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin12813600501681158812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18104092366977321410.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-18 20:47:13] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-18 20:47:13] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-18 20:47:13] [INFO ] Invariant cache hit.
[2023-03-18 20:47:14] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-03-18 20:47:14] [INFO ] Invariant cache hit.
[2023-03-18 20:47:14] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1335 ms. Remains : 500/500 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin3503214666264911554
[2023-03-18 20:47:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3503214666264911554
Running compilation step : cd /tmp/ltsmin3503214666264911554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 846 ms.
Running link step : cd /tmp/ltsmin3503214666264911554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3503214666264911554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7660525612417008044.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:47:29] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:47:29] [INFO ] Flatten gal took : 18 ms
[2023-03-18 20:47:29] [INFO ] Time to serialize gal into /tmp/LTL7468589542610264770.gal : 3 ms
[2023-03-18 20:47:29] [INFO ] Time to serialize properties into /tmp/LTL11293961947404838430.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7468589542610264770.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12484651720465134453.hoa' '-atoms' '/tmp/LTL11293961947404838430.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11293961947404838430.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12484651720465134453.hoa
Detected timeout of ITS tools.
[2023-03-18 20:47:44] [INFO ] Flatten gal took : 18 ms
[2023-03-18 20:47:44] [INFO ] Flatten gal took : 16 ms
[2023-03-18 20:47:44] [INFO ] Time to serialize gal into /tmp/LTL11588974304246849485.gal : 3 ms
[2023-03-18 20:47:44] [INFO ] Time to serialize properties into /tmp/LTL5036218398992606971.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11588974304246849485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5036218398992606971.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p1097==1)"))||("(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))")))))
Formula 0 simplified : XG(!"(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))" & X!"(p1097==1)")
Detected timeout of ITS tools.
[2023-03-18 20:47:59] [INFO ] Flatten gal took : 32 ms
[2023-03-18 20:47:59] [INFO ] Applying decomposition
[2023-03-18 20:47:59] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3363958513542665044.txt' '-o' '/tmp/graph3363958513542665044.bin' '-w' '/tmp/graph3363958513542665044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3363958513542665044.bin' '-l' '-1' '-v' '-w' '/tmp/graph3363958513542665044.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:48:00] [INFO ] Decomposing Gal with order
[2023-03-18 20:48:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:48:00] [INFO ] Removed a total of 317 redundant transitions.
[2023-03-18 20:48:00] [INFO ] Flatten gal took : 35 ms
[2023-03-18 20:48:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 308 labels/synchronizations in 7 ms.
[2023-03-18 20:48:00] [INFO ] Time to serialize gal into /tmp/LTL14799641059393833339.gal : 5 ms
[2023-03-18 20:48:00] [INFO ] Time to serialize properties into /tmp/LTL14700714784347819334.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14799641059393833339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14700714784347819334.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i18.i0.u164.p1097==1)"))||("(((i15.i2.u139.p928==1)&&(i15.i2.u141.p936==1))&&((i15.i1.u144.p963==1)&&(i18.i0.u164.p1097==1...164
Formula 0 simplified : XG(!"(((i15.i2.u139.p928==1)&&(i15.i2.u141.p936==1))&&((i15.i1.u144.p963==1)&&(i18.i0.u164.p1097==1)))" & X!"(i18.i0.u164.p1097==1)"...156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin366228056675907808
[2023-03-18 20:48:15] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin366228056675907808
Running compilation step : cd /tmp/ltsmin366228056675907808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 861 ms.
Running link step : cd /tmp/ltsmin366228056675907808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin366228056675907808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-13 finished in 117541 ms.
[2023-03-18 20:48:30] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12992159492966227013
[2023-03-18 20:48:30] [INFO ] Computing symmetric may disable matrix : 1048 transitions.
[2023-03-18 20:48:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:48:30] [INFO ] Computing symmetric may enable matrix : 1048 transitions.
[2023-03-18 20:48:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:48:30] [INFO ] Applying decomposition
[2023-03-18 20:48:30] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3795304987207091152.txt' '-o' '/tmp/graph3795304987207091152.bin' '-w' '/tmp/graph3795304987207091152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3795304987207091152.bin' '-l' '-1' '-v' '-w' '/tmp/graph3795304987207091152.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:48:30] [INFO ] Decomposing Gal with order
[2023-03-18 20:48:30] [INFO ] Computing Do-Not-Accords matrix : 1048 transitions.
[2023-03-18 20:48:30] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:48:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:48:30] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12992159492966227013
Running compilation step : cd /tmp/ltsmin12992159492966227013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 20:48:30] [INFO ] Removed a total of 460 redundant transitions.
[2023-03-18 20:48:30] [INFO ] Flatten gal took : 92 ms
[2023-03-18 20:48:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-18 20:48:30] [INFO ] Time to serialize gal into /tmp/LTLFireability11148386220149814078.gal : 15 ms
[2023-03-18 20:48:30] [INFO ] Time to serialize properties into /tmp/LTLFireability7976082382421505418.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11148386220149814078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7976082382421505418.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((F((G("((i15.i5.u293.p875==1)&&(i16.i4.u309.p926==1))"))||((X(X(!("((i15.i5.u293.p875==1)&&(i16.i4.u309.p926==1))"))))U(((X(X(!("((i...326
Formula 0 simplified : G(F!"((i15.i5.u293.p875==1)&&(i16.i4.u309.p926==1))" & (XX"((i15.i5.u293.p875==1)&&(i16.i4.u309.p926==1))" R (XXF"((i15.i5.u293.p875...289
Compilation finished in 3448 ms.
Running link step : cd /tmp/ltsmin12992159492966227013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 116 ms.
Running LTSmin : cd /tmp/ltsmin12992159492966227013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(X(X(!(LTLAPp0==true))) U ((X(X(!(LTLAPp0==true)))&&[](!(LTLAPp1==true)))||X(X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin12992159492966227013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(X(X(!(LTLAPp0==true))) U ((X(X(!(LTLAPp0==true)))&&[](!(LTLAPp1==true)))||X(X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12992159492966227013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp2==true)||<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 21:11:58] [INFO ] Applying decomposition
[2023-03-18 21:11:58] [INFO ] Flatten gal took : 215 ms
[2023-03-18 21:11:58] [INFO ] Decomposing Gal with order
[2023-03-18 21:11:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:11:59] [INFO ] Removed a total of 320 redundant transitions.
[2023-03-18 21:11:59] [INFO ] Flatten gal took : 401 ms
[2023-03-18 21:11:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 179 ms.
[2023-03-18 21:11:59] [INFO ] Time to serialize gal into /tmp/LTLFireability7795918249555776737.gal : 78 ms
[2023-03-18 21:11:59] [INFO ] Time to serialize properties into /tmp/LTLFireability17768950893423943691.ltl : 10 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7795918249555776737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17768950893423943691.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((F((G("((i0.i0.i0.i0.i0.i1.i0.i0.i0.u272.p875==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u287.p926==1))"))||((X(X(!("((i0.i0.i0.i0.i0.i1.i0...630
Formula 0 simplified : G(F!"((i0.i0.i0.i0.i0.i1.i0.i0.i0.u272.p875==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u287.p926==1))" & (XX"((i0.i0.i0.i0.i0.i1.i0.i0.i0.u...593
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin12992159492966227013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp2==true)||<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12992159492966227013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp4==true)||X((LTLAPp5==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 21:35:39] [INFO ] Flatten gal took : 388 ms
[2023-03-18 21:35:42] [INFO ] Input system was already deterministic with 1048 transitions.
[2023-03-18 21:35:42] [INFO ] Transformed 1068 places.
[2023-03-18 21:35:42] [INFO ] Transformed 1048 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
[2023-03-18 21:35:42] [INFO ] Time to serialize gal into /tmp/LTLFireability12027993255895606817.gal : 39 ms
[2023-03-18 21:35:42] [INFO ] Time to serialize properties into /tmp/LTLFireability13964265450387644142.ltl : 6 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12027993255895606817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13964265450387644142.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p875==1)&&(p926==1))"))||((X(X(!("((p875==1)&&(p926==1))"))))U(((X(X(!("((p875==1)&&(p926==1))"))))&&(G(!("((p96==1)&&(p113...210
Formula 0 simplified : G(F!"((p875==1)&&(p926==1))" & (XX"((p875==1)&&(p926==1))" R (XXF"((p875==1)&&(p926==1))" & (XX"((p875==1)&&(p926==1))" | F"((p96==1...173
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 13026156 kB
After kill :
MemTotal: 16393236 kB
MemFree: 15675968 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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