Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974900156.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974900156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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 ShieldRVs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679167156039

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=ShieldRVs-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 19:19:18] [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 19:19:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:19:18] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2023-03-18 19:19:18] [INFO ] Transformed 2003 places.
[2023-03-18 19:19:18] [INFO ] Transformed 2253 transitions.
[2023-03-18 19:19:18] [INFO ] Found NUPN structural information;
[2023-03-18 19:19:18] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 339 places :
Symmetric choice reduction at 0 with 339 rule applications. Total rules 339 place count 1664 transition count 1914
Iterating global reduction 0 with 339 rules applied. Total rules applied 678 place count 1664 transition count 1914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 679 place count 1663 transition count 1913
Iterating global reduction 0 with 1 rules applied. Total rules applied 680 place count 1663 transition count 1913
Applied a total of 680 rules in 598 ms. Remains 1663 /2003 variables (removed 340) and now considering 1913/2253 (removed 340) transitions.
// Phase 1: matrix 1913 rows 1663 cols
[2023-03-18 19:19:19] [INFO ] Computed 201 place invariants in 28 ms
[2023-03-18 19:19:20] [INFO ] Implicit Places using invariants in 860 ms returned []
[2023-03-18 19:19:20] [INFO ] Invariant cache hit.
[2023-03-18 19:19:22] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
[2023-03-18 19:19:22] [INFO ] Invariant cache hit.
[2023-03-18 19:19:23] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1663/2003 places, 1913/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4389 ms. Remains : 1663/2003 places, 1913/2253 transitions.
Support contains 46 out of 1663 places after structural reductions.
[2023-03-18 19:19:23] [INFO ] Flatten gal took : 168 ms
[2023-03-18 19:19:23] [INFO ] Flatten gal took : 94 ms
[2023-03-18 19:19:23] [INFO ] Input system was already deterministic with 1913 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 28) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-18 19:19:24] [INFO ] Invariant cache hit.
[2023-03-18 19:19:25] [INFO ] [Real]Absence check using 201 positive place invariants in 62 ms returned sat
[2023-03-18 19:19:25] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 19:19:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 65 ms returned sat
[2023-03-18 19:19:27] [INFO ] After 1548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 7 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 43 places in 309 ms of which 2 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 2 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 0 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 2 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5342 ms
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 1 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 0 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 4 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 1 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 1 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 1 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 1 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 1 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 1 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 1 ms to minimize.
[2023-03-18 19:19:38] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 4 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:19:39] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6690 ms
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:19:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1057 ms
[2023-03-18 19:19:41] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 1 ms to minimize.
[2023-03-18 19:19:41] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2023-03-18 19:19:42] [INFO ] Deduced a trap composed of 72 places in 163 ms of which 1 ms to minimize.
[2023-03-18 19:19:42] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 1 ms to minimize.
[2023-03-18 19:19:42] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 1 ms to minimize.
[2023-03-18 19:19:42] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 2 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 1 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 1 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 2 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3021 ms
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 0 ms to minimize.
[2023-03-18 19:19:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 634 ms
[2023-03-18 19:19:45] [INFO ] After 19491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1070 ms.
[2023-03-18 19:19:46] [INFO ] After 21205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1423 ms.
Support contains 22 out of 1663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1663 transition count 1714
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1464 transition count 1714
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 398 place count 1464 transition count 1465
Deduced a syphon composed of 249 places in 4 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 896 place count 1215 transition count 1465
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 901 place count 1210 transition count 1460
Iterating global reduction 2 with 5 rules applied. Total rules applied 906 place count 1210 transition count 1460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 906 place count 1210 transition count 1459
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 908 place count 1209 transition count 1459
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 1 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1894 place count 716 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 1993 place count 716 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1994 place count 715 transition count 965
Applied a total of 1994 rules in 533 ms. Remains 715 /1663 variables (removed 948) and now considering 965/1913 (removed 948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 715/1663 places, 965/1913 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 965 rows 715 cols
[2023-03-18 19:19:48] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-18 19:19:48] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:19:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-18 19:19:49] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 196 ms
[2023-03-18 19:19:49] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-18 19:19:49] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 7 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 965/965 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 707 transition count 957
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 706 transition count 956
Applied a total of 19 rules in 159 ms. Remains 706 /715 variables (removed 9) and now considering 956/965 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 706/715 places, 956/965 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-18 19:19:49] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-18 19:19:49] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-18 19:19:50] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:19:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-18 19:19:50] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:19:50] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-18 19:19:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-18 19:19:50] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-18 19:19:50] [INFO ] After 510ms 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 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 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 705 transition count 955
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 705 transition count 955
Applied a total of 3 rules in 56 ms. Remains 705 /706 variables (removed 1) and now considering 955/956 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 705/706 places, 955/956 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3039 steps, run visited all 1 properties in 35 ms. (steps per millisecond=86 )
Probabilistic random walk after 3039 steps, saw 2914 distinct states, run finished after 35 ms. (steps per millisecond=86 ) properties seen :1
FORMULA ShieldRVs-PT-050B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 404 stabilizing places and 404 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((X(p0) U p1)&&X(p0)))&&X(p2))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1654 transition count 1904
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1654 transition count 1904
Applied a total of 18 rules in 108 ms. Remains 1654 /1663 variables (removed 9) and now considering 1904/1913 (removed 9) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2023-03-18 19:19:51] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-18 19:19:51] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-18 19:19:51] [INFO ] Invariant cache hit.
[2023-03-18 19:19:53] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2023-03-18 19:19:53] [INFO ] Invariant cache hit.
[2023-03-18 19:19:54] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1663 places, 1904/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2919 ms. Remains : 1654/1663 places, 1904/1913 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s1602 1), p2:(AND (EQ s840 1) (EQ s849 1) (EQ s870 1) (EQ s1602 0)), p0:(EQ s903 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]]
Stuttering criterion allowed to conclude after 2198 steps with 0 reset in 31 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-00 finished in 3336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1461 transition count 1461
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1211 transition count 1461
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 913 place count 1200 transition count 1450
Iterating global reduction 2 with 11 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 924 place count 1200 transition count 1448
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 928 place count 1198 transition count 1448
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 2 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1916 place count 704 transition count 954
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 1918 place count 702 transition count 952
Applied a total of 1918 rules in 247 ms. Remains 702 /1663 variables (removed 961) and now considering 952/1913 (removed 961) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-18 19:19:54] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-18 19:19:55] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-18 19:19:55] [INFO ] Invariant cache hit.
[2023-03-18 19:19:55] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2023-03-18 19:19:55] [INFO ] Redundant transitions in 195 ms returned [951]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-18 19:19:55] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:19:56] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/1663 places, 951/1913 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1772 ms. Remains : 702/1663 places, 951/1913 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s370 1), p1:(OR (EQ s325 0) (EQ s341 0) (EQ s352 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 150 reset in 599 ms.
Product exploration explored 100000 steps with 150 reset in 648 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) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 312 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:19:58] [INFO ] Invariant cache hit.
[2023-03-18 19:19:58] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:19:58] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-18 19:19:58] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:19:58] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-03-18 19:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-18 19:19:58] [INFO ] After 398ms 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 19:19:58] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 56 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215642 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215642 steps, saw 94771 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 951 rows 702 cols
[2023-03-18 19:20:01] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-18 19:20:02] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:20:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:20:02] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 317 ms
[2023-03-18 19:20:02] [INFO ] After 688ms 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 19:20:02] [INFO ] After 900ms 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 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-18 19:20:03] [INFO ] Invariant cache hit.
[2023-03-18 19:20:03] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-18 19:20:03] [INFO ] Invariant cache hit.
[2023-03-18 19:20:04] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-18 19:20:04] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-18 19:20:04] [INFO ] Invariant cache hit.
[2023-03-18 19:20:04] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1465 ms. Remains : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 19:20:04] [INFO ] Invariant cache hit.
[2023-03-18 19:20:04] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:20:04] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-18 19:20:05] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2023-03-18 19:20:05] [INFO ] After 456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-18 19:20:05] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 314 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 32 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-18 19:20:05] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:20:05] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-18 19:20:05] [INFO ] Invariant cache hit.
[2023-03-18 19:20:06] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-18 19:20:06] [INFO ] Redundant transitions in 212 ms returned []
[2023-03-18 19:20:06] [INFO ] Invariant cache hit.
[2023-03-18 19:20:07] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1626 ms. Remains : 702/702 places, 951/951 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) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 287 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2318 steps, including 3 resets, run visited all 4 properties in 34 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 360 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 530 ms.
Product exploration explored 100000 steps with 150 reset in 767 ms.
Built C files in :
/tmp/ltsmin8084088395633361320
[2023-03-18 19:20:09] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2023-03-18 19:20:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:09] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2023-03-18 19:20:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:09] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2023-03-18 19:20:09] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:09] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8084088395633361320
Running compilation step : cd /tmp/ltsmin8084088395633361320;'/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 2699 ms.
Running link step : cd /tmp/ltsmin8084088395633361320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 104 ms.
Running LTSmin : cd /tmp/ltsmin8084088395633361320;'/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/stateBased8384534997315417728.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-18 19:20:24] [INFO ] Invariant cache hit.
[2023-03-18 19:20:24] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-18 19:20:24] [INFO ] Invariant cache hit.
[2023-03-18 19:20:25] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2023-03-18 19:20:25] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-18 19:20:25] [INFO ] Invariant cache hit.
[2023-03-18 19:20:25] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1362 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin1978376084255887951
[2023-03-18 19:20:25] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2023-03-18 19:20:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:25] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2023-03-18 19:20:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:26] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2023-03-18 19:20:26] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:20:26] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1978376084255887951
Running compilation step : cd /tmp/ltsmin1978376084255887951;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1978376084255887951;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1978376084255887951;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 19:20:29] [INFO ] Flatten gal took : 60 ms
[2023-03-18 19:20:29] [INFO ] Flatten gal took : 50 ms
[2023-03-18 19:20:29] [INFO ] Time to serialize gal into /tmp/LTL12350835672323671969.gal : 11 ms
[2023-03-18 19:20:29] [INFO ] Time to serialize properties into /tmp/LTL10744002258762507136.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/LTL12350835672323671969.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18170989084660778348.hoa' '-atoms' '/tmp/LTL10744002258762507136.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...320
Loading property file /tmp/LTL10744002258762507136.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18170989084660778348.hoa
Detected timeout of ITS tools.
[2023-03-18 19:20:44] [INFO ] Flatten gal took : 32 ms
[2023-03-18 19:20:44] [INFO ] Flatten gal took : 32 ms
[2023-03-18 19:20:44] [INFO ] Time to serialize gal into /tmp/LTL13565299931783896585.gal : 6 ms
[2023-03-18 19:20:44] [INFO ] Time to serialize properties into /tmp/LTL1629803130299035226.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/LTL13565299931783896585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1629803130299035226.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 : !((F((G("(p1077==1)"))||(G("(((p956==0)||(p997==0))||(p1024==0))")))))
Formula 0 simplified : G(F!"(p1077==1)" & F!"(((p956==0)||(p997==0))||(p1024==0))")
Detected timeout of ITS tools.
[2023-03-18 19:20:59] [INFO ] Flatten gal took : 60 ms
[2023-03-18 19:20:59] [INFO ] Applying decomposition
[2023-03-18 19:20:59] [INFO ] Flatten gal took : 45 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/graph405876598680677955.txt' '-o' '/tmp/graph405876598680677955.bin' '-w' '/tmp/graph405876598680677955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph405876598680677955.bin' '-l' '-1' '-v' '-w' '/tmp/graph405876598680677955.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:21:00] [INFO ] Decomposing Gal with order
[2023-03-18 19:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:21:00] [INFO ] Removed a total of 1045 redundant transitions.
[2023-03-18 19:21:00] [INFO ] Flatten gal took : 223 ms
[2023-03-18 19:21:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 948 labels/synchronizations in 49 ms.
[2023-03-18 19:21:00] [INFO ] Time to serialize gal into /tmp/LTL5483875286125784296.gal : 18 ms
[2023-03-18 19:21:00] [INFO ] Time to serialize properties into /tmp/LTL13477227839165514590.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/LTL5483875286125784296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13477227839165514590.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("(i8.u105.p1077==1)"))||(G("(((i7.u93.p956==0)||(i8.u97.p997==0))||(i8.u100.p1024==0))")))))
Formula 0 simplified : G(F!"(i8.u105.p1077==1)" & F!"(((i7.u93.p956==0)||(i8.u97.p997==0))||(i8.u100.p1024==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8253898543373291726
[2023-03-18 19:21:15] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8253898543373291726
Running compilation step : cd /tmp/ltsmin8253898543373291726;'/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 1899 ms.
Running link step : cd /tmp/ltsmin8253898543373291726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin8253898543373291726;'/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 ShieldRVs-PT-050B-LTLFireability-01 finished in 96158 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((G(p0)||X((p1||X(p2))))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 145 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-18 19:21:30] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-18 19:21:31] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-18 19:21:31] [INFO ] Invariant cache hit.
[2023-03-18 19:21:32] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2023-03-18 19:21:32] [INFO ] Invariant cache hit.
[2023-03-18 19:21:34] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3339 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1005 0), p1:(EQ s199 0), p2:(OR (EQ s1152 0) (EQ s1155 0) (EQ s1163 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33384 reset in 721 ms.
Product exploration explored 100000 steps with 33276 reset in 711 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 428 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 19:21:36] [INFO ] Invariant cache hit.
[2023-03-18 19:21:37] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 19:21:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2023-03-18 19:21:38] [INFO ] After 1233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 37 places in 436 ms of which 2 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 29 places in 423 ms of which 1 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 1 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 35 places in 421 ms of which 1 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 38 places in 439 ms of which 1 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 40 places in 434 ms of which 1 ms to minimize.
[2023-03-18 19:21:42] [INFO ] Deduced a trap composed of 31 places in 436 ms of which 2 ms to minimize.
[2023-03-18 19:21:42] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 1 ms to minimize.
[2023-03-18 19:21:43] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 2 ms to minimize.
[2023-03-18 19:21:43] [INFO ] Deduced a trap composed of 31 places in 456 ms of which 1 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 19 places in 452 ms of which 1 ms to minimize.
[2023-03-18 19:21:44] [INFO ] Deduced a trap composed of 29 places in 437 ms of which 1 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 27 places in 441 ms of which 2 ms to minimize.
[2023-03-18 19:21:45] [INFO ] Deduced a trap composed of 40 places in 482 ms of which 1 ms to minimize.
[2023-03-18 19:21:46] [INFO ] Deduced a trap composed of 18 places in 465 ms of which 1 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 48 places in 465 ms of which 1 ms to minimize.
[2023-03-18 19:21:47] [INFO ] Deduced a trap composed of 22 places in 550 ms of which 2 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 30 places in 444 ms of which 1 ms to minimize.
[2023-03-18 19:21:48] [INFO ] Deduced a trap composed of 57 places in 404 ms of which 2 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 54 places in 398 ms of which 1 ms to minimize.
[2023-03-18 19:21:49] [INFO ] Deduced a trap composed of 50 places in 381 ms of which 1 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 67 places in 414 ms of which 1 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 49 places in 420 ms of which 1 ms to minimize.
[2023-03-18 19:21:50] [INFO ] Deduced a trap composed of 45 places in 379 ms of which 1 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 1 ms to minimize.
[2023-03-18 19:21:51] [INFO ] Deduced a trap composed of 52 places in 370 ms of which 1 ms to minimize.
[2023-03-18 19:21:52] [INFO ] Deduced a trap composed of 58 places in 300 ms of which 1 ms to minimize.
[2023-03-18 19:21:52] [INFO ] Deduced a trap composed of 63 places in 279 ms of which 1 ms to minimize.
[2023-03-18 19:21:52] [INFO ] Deduced a trap composed of 50 places in 306 ms of which 0 ms to minimize.
[2023-03-18 19:21:53] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 1 ms to minimize.
[2023-03-18 19:21:53] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 0 ms to minimize.
[2023-03-18 19:21:53] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 2 ms to minimize.
[2023-03-18 19:21:54] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 1 ms to minimize.
[2023-03-18 19:21:54] [INFO ] Deduced a trap composed of 57 places in 290 ms of which 1 ms to minimize.
[2023-03-18 19:21:54] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 0 ms to minimize.
[2023-03-18 19:21:55] [INFO ] Deduced a trap composed of 60 places in 302 ms of which 1 ms to minimize.
[2023-03-18 19:21:55] [INFO ] Deduced a trap composed of 56 places in 282 ms of which 1 ms to minimize.
[2023-03-18 19:21:55] [INFO ] Deduced a trap composed of 59 places in 314 ms of which 1 ms to minimize.
[2023-03-18 19:21:56] [INFO ] Deduced a trap composed of 81 places in 278 ms of which 0 ms to minimize.
[2023-03-18 19:21:56] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 0 ms to minimize.
[2023-03-18 19:21:56] [INFO ] Deduced a trap composed of 52 places in 285 ms of which 1 ms to minimize.
[2023-03-18 19:21:57] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 0 ms to minimize.
[2023-03-18 19:21:57] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2023-03-18 19:21:57] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 2 ms to minimize.
[2023-03-18 19:21:58] [INFO ] Deduced a trap composed of 57 places in 319 ms of which 1 ms to minimize.
[2023-03-18 19:21:58] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 1 ms to minimize.
[2023-03-18 19:21:58] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 1 ms to minimize.
[2023-03-18 19:21:59] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 1 ms to minimize.
[2023-03-18 19:21:59] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 1 ms to minimize.
[2023-03-18 19:21:59] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 1 ms to minimize.
[2023-03-18 19:21:59] [INFO ] Deduced a trap composed of 57 places in 267 ms of which 1 ms to minimize.
[2023-03-18 19:22:00] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 1 ms to minimize.
[2023-03-18 19:22:00] [INFO ] Deduced a trap composed of 58 places in 295 ms of which 2 ms to minimize.
[2023-03-18 19:22:00] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 1 ms to minimize.
[2023-03-18 19:22:01] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 0 ms to minimize.
[2023-03-18 19:22:01] [INFO ] Deduced a trap composed of 67 places in 326 ms of which 1 ms to minimize.
[2023-03-18 19:22:01] [INFO ] Deduced a trap composed of 66 places in 300 ms of which 1 ms to minimize.
[2023-03-18 19:22:02] [INFO ] Deduced a trap composed of 78 places in 266 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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 19:22:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:22:02] [INFO ] After 25207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 259 ms.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 2 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 211 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 706/1653 places, 956/1903 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-18 19:22:02] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-18 19:22:03] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:22:03] [INFO ] [Nat]Absence check using 201 positive place invariants in 20 ms returned sat
[2023-03-18 19:22:03] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:22:03] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:22:03] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:22:03] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2023-03-18 19:22:03] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-18 19:22:03] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-18 19:22:04] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:22:04] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-18 19:22:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 785 ms
[2023-03-18 19:22:04] [INFO ] After 1065ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-18 19:22:04] [INFO ] After 1194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 704 transition count 954
Applied a total of 4 rules in 31 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 704/706 places, 954/956 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 364272 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 364272 steps, saw 357623 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 cols
[2023-03-18 19:22:07] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-18 19:22:07] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:22:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-18 19:22:08] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:22:08] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-18 19:22:08] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 12 ms to minimize.
[2023-03-18 19:22:08] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:22:08] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:22:08] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2023-03-18 19:22:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 627 ms
[2023-03-18 19:22:08] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 19:22:08] [INFO ] After 1207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 26 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 26 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-18 19:22:08] [INFO ] Invariant cache hit.
[2023-03-18 19:22:09] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-18 19:22:09] [INFO ] Invariant cache hit.
[2023-03-18 19:22:09] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2023-03-18 19:22:10] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-18 19:22:10] [INFO ] Invariant cache hit.
[2023-03-18 19:22:10] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1714 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 19:22:10] [INFO ] Invariant cache hit.
[2023-03-18 19:22:10] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:22:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-18 19:22:10] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:22:11] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-18 19:22:11] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-18 19:22:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-18 19:22:11] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-18 19:22:11] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 668 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 98 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-18 19:22:12] [INFO ] Computed 201 place invariants in 17 ms
[2023-03-18 19:22:13] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-18 19:22:13] [INFO ] Invariant cache hit.
[2023-03-18 19:22:14] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-18 19:22:14] [INFO ] Invariant cache hit.
[2023-03-18 19:22:15] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3065 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:22:16] [INFO ] Invariant cache hit.
[2023-03-18 19:22:16] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:22:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 49 ms returned sat
[2023-03-18 19:22:17] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:22:18] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 1 ms to minimize.
[2023-03-18 19:22:18] [INFO ] Deduced a trap composed of 29 places in 379 ms of which 0 ms to minimize.
[2023-03-18 19:22:18] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 1 ms to minimize.
[2023-03-18 19:22:19] [INFO ] Deduced a trap composed of 35 places in 422 ms of which 1 ms to minimize.
[2023-03-18 19:22:19] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 1 ms to minimize.
[2023-03-18 19:22:20] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 1 ms to minimize.
[2023-03-18 19:22:20] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 1 ms to minimize.
[2023-03-18 19:22:21] [INFO ] Deduced a trap composed of 54 places in 361 ms of which 1 ms to minimize.
[2023-03-18 19:22:21] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 1 ms to minimize.
[2023-03-18 19:22:21] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 0 ms to minimize.
[2023-03-18 19:22:22] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 1 ms to minimize.
[2023-03-18 19:22:22] [INFO ] Deduced a trap composed of 22 places in 417 ms of which 1 ms to minimize.
[2023-03-18 19:22:23] [INFO ] Deduced a trap composed of 27 places in 416 ms of which 1 ms to minimize.
[2023-03-18 19:22:23] [INFO ] Deduced a trap composed of 32 places in 412 ms of which 1 ms to minimize.
[2023-03-18 19:22:24] [INFO ] Deduced a trap composed of 29 places in 472 ms of which 1 ms to minimize.
[2023-03-18 19:22:24] [INFO ] Deduced a trap composed of 33 places in 434 ms of which 1 ms to minimize.
[2023-03-18 19:22:25] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 1 ms to minimize.
[2023-03-18 19:22:25] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 1 ms to minimize.
[2023-03-18 19:22:26] [INFO ] Deduced a trap composed of 24 places in 440 ms of which 1 ms to minimize.
[2023-03-18 19:22:26] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 1 ms to minimize.
[2023-03-18 19:22:27] [INFO ] Deduced a trap composed of 26 places in 443 ms of which 1 ms to minimize.
[2023-03-18 19:22:27] [INFO ] Deduced a trap composed of 31 places in 478 ms of which 1 ms to minimize.
[2023-03-18 19:22:28] [INFO ] Deduced a trap composed of 43 places in 364 ms of which 1 ms to minimize.
[2023-03-18 19:22:28] [INFO ] Deduced a trap composed of 55 places in 366 ms of which 1 ms to minimize.
[2023-03-18 19:22:29] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 0 ms to minimize.
[2023-03-18 19:22:29] [INFO ] Deduced a trap composed of 34 places in 415 ms of which 1 ms to minimize.
[2023-03-18 19:22:30] [INFO ] Deduced a trap composed of 42 places in 406 ms of which 0 ms to minimize.
[2023-03-18 19:22:30] [INFO ] Deduced a trap composed of 57 places in 421 ms of which 1 ms to minimize.
[2023-03-18 19:22:31] [INFO ] Deduced a trap composed of 56 places in 352 ms of which 1 ms to minimize.
[2023-03-18 19:22:31] [INFO ] Deduced a trap composed of 50 places in 374 ms of which 1 ms to minimize.
[2023-03-18 19:22:31] [INFO ] Deduced a trap composed of 44 places in 354 ms of which 1 ms to minimize.
[2023-03-18 19:22:32] [INFO ] Deduced a trap composed of 48 places in 343 ms of which 1 ms to minimize.
[2023-03-18 19:22:32] [INFO ] Deduced a trap composed of 53 places in 335 ms of which 0 ms to minimize.
[2023-03-18 19:22:33] [INFO ] Deduced a trap composed of 46 places in 336 ms of which 1 ms to minimize.
[2023-03-18 19:22:33] [INFO ] Deduced a trap composed of 49 places in 320 ms of which 1 ms to minimize.
[2023-03-18 19:22:33] [INFO ] Deduced a trap composed of 42 places in 426 ms of which 1 ms to minimize.
[2023-03-18 19:22:34] [INFO ] Deduced a trap composed of 63 places in 387 ms of which 1 ms to minimize.
[2023-03-18 19:22:34] [INFO ] Deduced a trap composed of 53 places in 322 ms of which 0 ms to minimize.
[2023-03-18 19:22:35] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 1 ms to minimize.
[2023-03-18 19:22:35] [INFO ] Deduced a trap composed of 54 places in 323 ms of which 1 ms to minimize.
[2023-03-18 19:22:36] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 1 ms to minimize.
[2023-03-18 19:22:36] [INFO ] Deduced a trap composed of 63 places in 407 ms of which 1 ms to minimize.
[2023-03-18 19:22:36] [INFO ] Deduced a trap composed of 57 places in 371 ms of which 1 ms to minimize.
[2023-03-18 19:22:37] [INFO ] Deduced a trap composed of 45 places in 443 ms of which 1 ms to minimize.
[2023-03-18 19:22:38] [INFO ] Deduced a trap composed of 62 places in 441 ms of which 1 ms to minimize.
[2023-03-18 19:22:38] [INFO ] Deduced a trap composed of 74 places in 317 ms of which 1 ms to minimize.
[2023-03-18 19:22:38] [INFO ] Deduced a trap composed of 62 places in 386 ms of which 0 ms to minimize.
[2023-03-18 19:22:39] [INFO ] Deduced a trap composed of 47 places in 338 ms of which 0 ms to minimize.
[2023-03-18 19:22:39] [INFO ] Deduced a trap composed of 49 places in 376 ms of which 1 ms to minimize.
[2023-03-18 19:22:40] [INFO ] Deduced a trap composed of 46 places in 336 ms of which 1 ms to minimize.
[2023-03-18 19:22:40] [INFO ] Deduced a trap composed of 47 places in 400 ms of which 1 ms to minimize.
[2023-03-18 19:22:41] [INFO ] Deduced a trap composed of 50 places in 394 ms of which 1 ms to minimize.
[2023-03-18 19:22:41] [INFO ] Deduced a trap composed of 51 places in 391 ms of which 1 ms to minimize.
[2023-03-18 19:22:41] [INFO ] Deduced a trap composed of 56 places in 396 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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 19:22:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:22:41] [INFO ] After 25394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 190 ms.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 276 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 706/1653 places, 956/1903 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-18 19:22:42] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:22:42] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:22:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:22:43] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:22:43] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:22:43] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-18 19:22:43] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:22:43] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-18 19:22:43] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-18 19:22:44] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:22:44] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:22:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 909 ms
[2023-03-18 19:22:44] [INFO ] After 1262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-18 19:22:44] [INFO ] After 1440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 704 transition count 954
Applied a total of 4 rules in 33 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 704/706 places, 954/956 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 420098 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 420098 steps, saw 412407 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 cols
[2023-03-18 19:22:47] [INFO ] Computed 201 place invariants in 14 ms
[2023-03-18 19:22:47] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:22:47] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-18 19:22:48] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:22:48] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:22:48] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-18 19:22:48] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-18 19:22:48] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2023-03-18 19:22:48] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2023-03-18 19:22:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 589 ms
[2023-03-18 19:22:48] [INFO ] After 949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-18 19:22:48] [INFO ] After 1122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 49 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 27 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-18 19:22:48] [INFO ] Invariant cache hit.
[2023-03-18 19:22:49] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-18 19:22:49] [INFO ] Invariant cache hit.
[2023-03-18 19:22:55] [INFO ] Implicit Places using invariants and state equation in 6711 ms returned []
Implicit Place search using SMT with State Equation took 7140 ms to find 0 implicit places.
[2023-03-18 19:22:56] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-18 19:22:56] [INFO ] Invariant cache hit.
[2023-03-18 19:22:56] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7784 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 22 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 19:22:56] [INFO ] Invariant cache hit.
[2023-03-18 19:22:56] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:22:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-18 19:22:57] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:22:57] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-18 19:22:57] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2023-03-18 19:22:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2023-03-18 19:22:57] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-18 19:22:57] [INFO ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 663 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 33548 reset in 856 ms.
Product exploration explored 100000 steps with 33311 reset in 562 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1653 transition count 1903
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 104 Pre rules applied. Total rules applied 197 place count 1653 transition count 1953
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 301 place count 1653 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 302 place count 1652 transition count 1952
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 303 place count 1652 transition count 1952
Performed 645 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 945 places in 2 ms
Iterating global reduction 1 with 645 rules applied. Total rules applied 948 place count 1652 transition count 1952
Renaming transitions due to excessive name length > 1024 char.
Discarding 344 places :
Symmetric choice reduction at 1 with 344 rule applications. Total rules 1292 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 2 ms
Iterating global reduction 1 with 344 rules applied. Total rules applied 1636 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 2 ms
Applied a total of 1636 rules in 871 ms. Remains 1308 /1653 variables (removed 345) and now considering 1608/1903 (removed 295) transitions.
[2023-03-18 19:23:02] [INFO ] Redundant transitions in 195 ms returned [1607]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1607 rows 1308 cols
[2023-03-18 19:23:02] [INFO ] Computed 201 place invariants in 20 ms
[2023-03-18 19:23:03] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1308/1653 places, 1607/1903 transitions.
Deduced a syphon composed of 601 places in 2 ms
Applied a total of 0 rules in 58 ms. Remains 1308 /1308 variables (removed 0) and now considering 1607/1607 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2129 ms. Remains : 1308/1653 places, 1607/1903 transitions.
Built C files in :
/tmp/ltsmin15349031413793602581
[2023-03-18 19:23:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15349031413793602581
Running compilation step : cd /tmp/ltsmin15349031413793602581;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15349031413793602581;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15349031413793602581;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 42 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-18 19:23:06] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-18 19:23:06] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-18 19:23:06] [INFO ] Invariant cache hit.
[2023-03-18 19:23:08] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
[2023-03-18 19:23:08] [INFO ] Invariant cache hit.
[2023-03-18 19:23:09] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2982 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Built C files in :
/tmp/ltsmin6605829899602935089
[2023-03-18 19:23:09] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6605829899602935089
Running compilation step : cd /tmp/ltsmin6605829899602935089;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6605829899602935089;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6605829899602935089;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 19:23:12] [INFO ] Flatten gal took : 83 ms
[2023-03-18 19:23:12] [INFO ] Flatten gal took : 67 ms
[2023-03-18 19:23:12] [INFO ] Time to serialize gal into /tmp/LTL12545125754501972031.gal : 11 ms
[2023-03-18 19:23:12] [INFO ] Time to serialize properties into /tmp/LTL12714622813210885547.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/LTL12545125754501972031.gal' '-t' 'CGAL' '-hoa' '/tmp/aut855074444431290578.hoa' '-atoms' '/tmp/LTL12714622813210885547.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/LTL12714622813210885547.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut855074444431290578.hoa
Detected timeout of ITS tools.
[2023-03-18 19:23:27] [INFO ] Flatten gal took : 80 ms
[2023-03-18 19:23:27] [INFO ] Flatten gal took : 64 ms
[2023-03-18 19:23:27] [INFO ] Time to serialize gal into /tmp/LTL9562163552124024939.gal : 10 ms
[2023-03-18 19:23:27] [INFO ] Time to serialize properties into /tmp/LTL17304958245445176398.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/LTL9562163552124024939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17304958245445176398.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 : !((G((G("(p1212==0)"))||(X(("(p230==0)")||(X("(((p1390==0)||(p1395==0))||(p1404==0))")))))))
Formula 0 simplified : F(F!"(p1212==0)" & X(!"(p230==0)" & X!"(((p1390==0)||(p1395==0))||(p1404==0))"))
Detected timeout of ITS tools.
[2023-03-18 19:23:43] [INFO ] Flatten gal took : 89 ms
[2023-03-18 19:23:43] [INFO ] Applying decomposition
[2023-03-18 19:23:43] [INFO ] Flatten gal took : 66 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/graph12705010739855514647.txt' '-o' '/tmp/graph12705010739855514647.bin' '-w' '/tmp/graph12705010739855514647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12705010739855514647.bin' '-l' '-1' '-v' '-w' '/tmp/graph12705010739855514647.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:23:43] [INFO ] Decomposing Gal with order
[2023-03-18 19:23:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:23:43] [INFO ] Removed a total of 1791 redundant transitions.
[2023-03-18 19:23:43] [INFO ] Flatten gal took : 261 ms
[2023-03-18 19:23:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-18 19:23:44] [INFO ] Time to serialize gal into /tmp/LTL13243629313106024919.gal : 60 ms
[2023-03-18 19:23:44] [INFO ] Time to serialize properties into /tmp/LTL6595051571295695074.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/LTL13243629313106024919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6595051571295695074.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 : !((G((G("(i12.u380.p1212==0)"))||(X(("(i1.u78.p230==0)")||(X("(((i14.u435.p1390==0)||(i14.u436.p1395==0))||(i14.u439.p1404==0))"))))))...156
Formula 0 simplified : F(F!"(i12.u380.p1212==0)" & X(!"(i1.u78.p230==0)" & X!"(((i14.u435.p1390==0)||(i14.u436.p1395==0))||(i14.u439.p1404==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7904981505387164157
[2023-03-18 19:23:59] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7904981505387164157
Running compilation step : cd /tmp/ltsmin7904981505387164157;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7904981505387164157;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7904981505387164157;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-050B-LTLFireability-02 finished in 151600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 119 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-18 19:24:02] [INFO ] Computed 201 place invariants in 16 ms
[2023-03-18 19:24:03] [INFO ] Implicit Places using invariants in 786 ms returned []
[2023-03-18 19:24:03] [INFO ] Invariant cache hit.
[2023-03-18 19:24:05] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
[2023-03-18 19:24:05] [INFO ] Invariant cache hit.
[2023-03-18 19:24:05] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3678 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s479 0) (EQ s482 0) (EQ s489 0)), p1:(EQ s1317 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3812 steps with 1 reset in 40 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-04 finished in 3835 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)))'
Support contains 1 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 117 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-18 19:24:06] [INFO ] Computed 201 place invariants in 16 ms
[2023-03-18 19:24:06] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-18 19:24:06] [INFO ] Invariant cache hit.
[2023-03-18 19:24:08] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2023-03-18 19:24:08] [INFO ] Invariant cache hit.
[2023-03-18 19:24:08] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2844 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s98 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]]
Stuttering criterion allowed to conclude after 14467 steps with 6 reset in 101 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-05 finished in 3029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 402 place count 1461 transition count 1463
Deduced a syphon composed of 248 places in 1 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 898 place count 1213 transition count 1463
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 909 place count 1202 transition count 1452
Iterating global reduction 2 with 11 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 920 place count 1202 transition count 1450
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 2 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1914 place count 705 transition count 955
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 1916 place count 703 transition count 953
Applied a total of 1916 rules in 279 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:24:09] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:24:09] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-18 19:24:09] [INFO ] Invariant cache hit.
[2023-03-18 19:24:10] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2023-03-18 19:24:10] [INFO ] Redundant transitions in 152 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-18 19:24:10] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-18 19:24:10] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 20 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1627 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 164 reset in 661 ms.
Product exploration explored 100000 steps with 164 reset in 568 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 633 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=158 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-18 19:24:12] [INFO ] Invariant cache hit.
[2023-03-18 19:24:13] [INFO ] [Real]Absence check using 201 positive place invariants in 94 ms returned sat
[2023-03-18 19:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 19:24:13] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2023-03-18 19:24:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 19:24:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 71 ms returned sat
[2023-03-18 19:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 19:24:15] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2023-03-18 19:24:15] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 57 ms.
[2023-03-18 19:24:28] [INFO ] Added : 580 causal constraints over 116 iterations in 13483 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 40 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-18 19:24:28] [INFO ] Invariant cache hit.
[2023-03-18 19:24:29] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-18 19:24:29] [INFO ] Invariant cache hit.
[2023-03-18 19:24:29] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-18 19:24:30] [INFO ] Redundant transitions in 184 ms returned []
[2023-03-18 19:24:30] [INFO ] Invariant cache hit.
[2023-03-18 19:24:30] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1629 ms. Remains : 703/703 places, 952/952 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 603 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=100 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
[2023-03-18 19:24:30] [INFO ] Invariant cache hit.
[2023-03-18 19:24:31] [INFO ] [Real]Absence check using 201 positive place invariants in 60 ms returned sat
[2023-03-18 19:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 19:24:32] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2023-03-18 19:24:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 19:24:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 59 ms returned sat
[2023-03-18 19:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 19:24:33] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2023-03-18 19:24:33] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 83 ms.
[2023-03-18 19:24:47] [INFO ] Added : 655 causal constraints over 131 iterations in 13537 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 163 reset in 712 ms.
Product exploration explored 100000 steps with 164 reset in 596 ms.
Built C files in :
/tmp/ltsmin3392141583572180227
[2023-03-18 19:24:48] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2023-03-18 19:24:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:24:48] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2023-03-18 19:24:48] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:24:48] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2023-03-18 19:24:48] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:24:48] [INFO ] Built C files in 242ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3392141583572180227
Running compilation step : cd /tmp/ltsmin3392141583572180227;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3392141583572180227;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3392141583572180227;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 23 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-18 19:24:51] [INFO ] Invariant cache hit.
[2023-03-18 19:24:52] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-18 19:24:52] [INFO ] Invariant cache hit.
[2023-03-18 19:24:53] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2023-03-18 19:24:53] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-18 19:24:53] [INFO ] Invariant cache hit.
[2023-03-18 19:24:53] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2119 ms. Remains : 703/703 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin2143701671179930961
[2023-03-18 19:24:54] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2023-03-18 19:24:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:24:54] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2023-03-18 19:24:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:24:54] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2023-03-18 19:24:54] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:24:54] [INFO ] Built C files in 221ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2143701671179930961
Running compilation step : cd /tmp/ltsmin2143701671179930961;'/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 2812 ms.
Running link step : cd /tmp/ltsmin2143701671179930961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 111 ms.
Running LTSmin : cd /tmp/ltsmin2143701671179930961;'/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/stateBased1643662962030502264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 19:25:09] [INFO ] Flatten gal took : 28 ms
[2023-03-18 19:25:09] [INFO ] Flatten gal took : 22 ms
[2023-03-18 19:25:09] [INFO ] Time to serialize gal into /tmp/LTL145356742866036888.gal : 4 ms
[2023-03-18 19:25:09] [INFO ] Time to serialize properties into /tmp/LTL11825566846043928701.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/LTL145356742866036888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7957567820425213301.hoa' '-atoms' '/tmp/LTL11825566846043928701.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/LTL11825566846043928701.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7957567820425213301.hoa
Detected timeout of ITS tools.
[2023-03-18 19:25:24] [INFO ] Flatten gal took : 34 ms
[2023-03-18 19:25:24] [INFO ] Flatten gal took : 32 ms
[2023-03-18 19:25:24] [INFO ] Time to serialize gal into /tmp/LTL5896868860941952660.gal : 19 ms
[2023-03-18 19:25:24] [INFO ] Time to serialize properties into /tmp/LTL14932012417553246414.ltl : 4 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/LTL5896868860941952660.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14932012417553246414.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 : !((F("((p148==1)&&(p161==1))")))
Formula 0 simplified : G!"((p148==1)&&(p161==1))"
Detected timeout of ITS tools.
[2023-03-18 19:25:39] [INFO ] Flatten gal took : 69 ms
[2023-03-18 19:25:39] [INFO ] Applying decomposition
[2023-03-18 19:25:39] [INFO ] Flatten gal took : 45 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/graph17319762126027903541.txt' '-o' '/tmp/graph17319762126027903541.bin' '-w' '/tmp/graph17319762126027903541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17319762126027903541.bin' '-l' '-1' '-v' '-w' '/tmp/graph17319762126027903541.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:25:39] [INFO ] Decomposing Gal with order
[2023-03-18 19:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:25:39] [INFO ] Removed a total of 1045 redundant transitions.
[2023-03-18 19:25:39] [INFO ] Flatten gal took : 116 ms
[2023-03-18 19:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1036 labels/synchronizations in 23 ms.
[2023-03-18 19:25:39] [INFO ] Time to serialize gal into /tmp/LTL9707166293711534474.gal : 6 ms
[2023-03-18 19:25:39] [INFO ] Time to serialize properties into /tmp/LTL13466070746030863762.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/LTL9707166293711534474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13466070746030863762.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("((i0.u10.p148==1)&&(i0.u12.p161==1))")))
Formula 0 simplified : G!"((i0.u10.p148==1)&&(i0.u12.p161==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10720948768864225345
[2023-03-18 19:25:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10720948768864225345
Running compilation step : cd /tmp/ltsmin10720948768864225345;'/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 1868 ms.
Running link step : cd /tmp/ltsmin10720948768864225345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin10720948768864225345;'/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))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050B-LTLFireability-07 finished in 120833 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||G(F(p1))||G(p2)))))'
Support contains 3 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1461 transition count 1461
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1211 transition count 1461
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 911 place count 1202 transition count 1452
Iterating global reduction 2 with 9 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 920 place count 1202 transition count 1451
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 922 place count 1201 transition count 1451
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 2 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 2 with 992 rules applied. Total rules applied 1914 place count 705 transition count 955
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 1916 place count 703 transition count 953
Applied a total of 1916 rules in 207 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:26:10] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-18 19:26:10] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-18 19:26:10] [INFO ] Invariant cache hit.
[2023-03-18 19:26:11] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-18 19:26:11] [INFO ] Redundant transitions in 113 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-18 19:26:11] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:26:11] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 18 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1647 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s71 1), p2:(EQ s5 0), p0:(EQ s205 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 149 reset in 518 ms.
Product exploration explored 100000 steps with 150 reset in 597 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 p1) p2 p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:26:13] [INFO ] Invariant cache hit.
[2023-03-18 19:26:13] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:26:13] [INFO ] [Nat]Absence check using 201 positive place invariants in 39 ms returned sat
[2023-03-18 19:26:14] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:26:14] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:26:14] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:26:14] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:26:14] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-18 19:26:14] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-18 19:26:14] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-18 19:26:15] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-18 19:26:15] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-18 19:26:15] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 13 ms to minimize.
[2023-03-18 19:26:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1130 ms
[2023-03-18 19:26:15] [INFO ] After 1512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-18 19:26:15] [INFO ] After 1744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 703 transition count 952
Applied a total of 101 rules in 58 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 703/703 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4379 steps, run visited all 1 properties in 47 ms. (steps per millisecond=93 )
Probabilistic random walk after 4379 steps, saw 4228 distinct states, run finished after 48 ms. (steps per millisecond=91 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 37 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-18 19:26:16] [INFO ] Invariant cache hit.
[2023-03-18 19:26:16] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-18 19:26:16] [INFO ] Invariant cache hit.
[2023-03-18 19:26:17] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2023-03-18 19:26:17] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-18 19:26:17] [INFO ] Invariant cache hit.
[2023-03-18 19:26:17] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1796 ms. Remains : 703/703 places, 952/952 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:26:18] [INFO ] Invariant cache hit.
[2023-03-18 19:26:18] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:26:18] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-18 19:26:18] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:26:18] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-18 19:26:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1065 ms
[2023-03-18 19:26:19] [INFO ] After 1397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 19:26:19] [INFO ] After 1585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 703 transition count 952
Applied a total of 101 rules in 56 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 703/703 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4379 steps, run visited all 1 properties in 46 ms. (steps per millisecond=95 )
Probabilistic random walk after 4379 steps, saw 4228 distinct states, run finished after 47 ms. (steps per millisecond=93 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 149 reset in 700 ms.
Product exploration explored 100000 steps with 149 reset in 590 ms.
Built C files in :
/tmp/ltsmin11834420236992531265
[2023-03-18 19:26:22] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2023-03-18 19:26:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:26:22] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2023-03-18 19:26:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:26:22] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2023-03-18 19:26:22] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:26:22] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11834420236992531265
Running compilation step : cd /tmp/ltsmin11834420236992531265;'/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 2498 ms.
Running link step : cd /tmp/ltsmin11834420236992531265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin11834420236992531265;'/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/stateBased1677020619865837420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 18 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-18 19:26:37] [INFO ] Invariant cache hit.
[2023-03-18 19:26:37] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-18 19:26:37] [INFO ] Invariant cache hit.
[2023-03-18 19:26:37] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2023-03-18 19:26:38] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-18 19:26:38] [INFO ] Invariant cache hit.
[2023-03-18 19:26:38] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1414 ms. Remains : 703/703 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin779766220078041646
[2023-03-18 19:26:38] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2023-03-18 19:26:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:26:38] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2023-03-18 19:26:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:26:38] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2023-03-18 19:26:38] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:26:38] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin779766220078041646
Running compilation step : cd /tmp/ltsmin779766220078041646;'/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 2637 ms.
Running link step : cd /tmp/ltsmin779766220078041646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin779766220078041646;'/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/stateBased7926663233201117674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 19:26:53] [INFO ] Flatten gal took : 23 ms
[2023-03-18 19:26:53] [INFO ] Flatten gal took : 22 ms
[2023-03-18 19:26:53] [INFO ] Time to serialize gal into /tmp/LTL11534656565926177829.gal : 5 ms
[2023-03-18 19:26:53] [INFO ] Time to serialize properties into /tmp/LTL18254810877085199819.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/LTL11534656565926177829.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7018259214236594363.hoa' '-atoms' '/tmp/LTL18254810877085199819.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/LTL18254810877085199819.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7018259214236594363.hoa
Detected timeout of ITS tools.
[2023-03-18 19:27:08] [INFO ] Flatten gal took : 37 ms
[2023-03-18 19:27:08] [INFO ] Flatten gal took : 32 ms
[2023-03-18 19:27:08] [INFO ] Time to serialize gal into /tmp/LTL17110103801167586890.gal : 6 ms
[2023-03-18 19:27:08] [INFO ] Time to serialize properties into /tmp/LTL13891651711089151595.ltl : 3 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/LTL17110103801167586890.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13891651711089151595.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 : !((G(F((("(p618==0)")||(G(F("(p242==1)"))))||(G("(p62==0)"))))))
Formula 0 simplified : G(F!"(p62==0)" & FG(!"(p242==1)" & !"(p618==0)"))
Detected timeout of ITS tools.
[2023-03-18 19:27:23] [INFO ] Flatten gal took : 54 ms
[2023-03-18 19:27:23] [INFO ] Applying decomposition
[2023-03-18 19:27:23] [INFO ] Flatten gal took : 41 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/graph16520429723566733085.txt' '-o' '/tmp/graph16520429723566733085.bin' '-w' '/tmp/graph16520429723566733085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16520429723566733085.bin' '-l' '-1' '-v' '-w' '/tmp/graph16520429723566733085.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:27:24] [INFO ] Decomposing Gal with order
[2023-03-18 19:27:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:27:24] [INFO ] Removed a total of 1051 redundant transitions.
[2023-03-18 19:27:24] [INFO ] Flatten gal took : 73 ms
[2023-03-18 19:27:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 16 ms.
[2023-03-18 19:27:24] [INFO ] Time to serialize gal into /tmp/LTL1215398685182787270.gal : 9 ms
[2023-03-18 19:27:24] [INFO ] Time to serialize properties into /tmp/LTL8582213071638736597.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/LTL1215398685182787270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8582213071638736597.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 : !((G(F((("(i4.u59.p618==0)")||(G(F("(i1.u20.p242==1)"))))||(G("(i0.u1.p62==0)"))))))
Formula 0 simplified : G(F!"(i0.u1.p62==0)" & FG(!"(i1.u20.p242==1)" & !"(i4.u59.p618==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11398120366518262761
[2023-03-18 19:27:39] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11398120366518262761
Running compilation step : cd /tmp/ltsmin11398120366518262761;'/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 1893 ms.
Running link step : cd /tmp/ltsmin11398120366518262761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin11398120366518262761;'/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)))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050B-LTLFireability-10 finished in 104378 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(p0)&&(p1 U G(p2)))))'
Support contains 6 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 142 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-18 19:27:54] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-18 19:27:54] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-18 19:27:54] [INFO ] Invariant cache hit.
[2023-03-18 19:27:56] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
[2023-03-18 19:27:56] [INFO ] Invariant cache hit.
[2023-03-18 19:27:57] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3050 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s1311 1) (EQ s1315 1) (EQ s1322 1))) (EQ s423 1)), p1:(AND (EQ s1311 1) (EQ s1315 1) (EQ s1322 1)), p0:(OR (EQ s1336 1) (EQ s1048 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-11 finished in 3359 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((G(p2)&&p1))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1662 transition count 1712
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1462 transition count 1712
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 400 place count 1462 transition count 1463
Deduced a syphon composed of 249 places in 5 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 898 place count 1213 transition count 1463
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 908 place count 1203 transition count 1453
Iterating global reduction 2 with 10 rules applied. Total rules applied 918 place count 1203 transition count 1453
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 918 place count 1203 transition count 1451
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 922 place count 1201 transition count 1451
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1910 place count 707 transition count 957
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 1912 place count 705 transition count 955
Applied a total of 1912 rules in 298 ms. Remains 705 /1663 variables (removed 958) and now considering 955/1913 (removed 958) transitions.
// Phase 1: matrix 955 rows 705 cols
[2023-03-18 19:27:58] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:27:58] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-18 19:27:58] [INFO ] Invariant cache hit.
[2023-03-18 19:27:59] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2023-03-18 19:27:59] [INFO ] Redundant transitions in 176 ms returned [954]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 954 rows 705 cols
[2023-03-18 19:27:59] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-18 19:27:59] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1663 places, 954/1913 transitions.
Applied a total of 0 rules in 19 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2122 ms. Remains : 705/1663 places, 954/1913 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s671 1) (EQ s675 1) (EQ s684 1) (NEQ s403 1)), p2:(EQ s606 1), p0:(EQ s403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 677 steps with 0 reset in 8 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-12 finished in 2340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))||G((p1 U p2))||X(X(p3))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 128 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-18 19:28:00] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-18 19:28:00] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-18 19:28:00] [INFO ] Invariant cache hit.
[2023-03-18 19:28:02] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
[2023-03-18 19:28:02] [INFO ] Invariant cache hit.
[2023-03-18 19:28:03] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2964 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 563 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p3), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=7 dest: 10}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(OR p2 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(EQ s1323 1), p2:(AND (EQ s379 1) (EQ s413 1) (EQ s435 1)), p1:(EQ s1360 1), p3:(AND (EQ s1323 1) (EQ s379 1) (EQ s413 1) (EQ s435 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-13 finished in 3579 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 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 402 place count 1461 transition count 1462
Deduced a syphon composed of 249 places in 4 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 900 place count 1212 transition count 1462
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 910 place count 1202 transition count 1452
Iterating global reduction 2 with 10 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 920 place count 1202 transition count 1450
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 1 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1914 place count 705 transition count 955
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 1916 place count 703 transition count 953
Applied a total of 1916 rules in 295 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:28:03] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:28:04] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-18 19:28:04] [INFO ] Invariant cache hit.
[2023-03-18 19:28:05] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-18 19:28:05] [INFO ] Redundant transitions in 189 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-18 19:28:05] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-18 19:28:05] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2023 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s581 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 149 reset in 494 ms.
Product exploration explored 100000 steps with 149 reset in 571 ms.
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/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 18 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-18 19:28:07] [INFO ] Invariant cache hit.
[2023-03-18 19:28:07] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-18 19:28:07] [INFO ] Invariant cache hit.
[2023-03-18 19:28:08] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2023-03-18 19:28:08] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-18 19:28:08] [INFO ] Invariant cache hit.
[2023-03-18 19:28:08] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1705 ms. Remains : 703/703 places, 952/952 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/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 19 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 150 reset in 499 ms.
Product exploration explored 100000 steps with 149 reset in 568 ms.
Built C files in :
/tmp/ltsmin1808593953580830237
[2023-03-18 19:28:10] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2023-03-18 19:28:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:28:10] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2023-03-18 19:28:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:28:10] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2023-03-18 19:28:10] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:28:10] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1808593953580830237
Running compilation step : cd /tmp/ltsmin1808593953580830237;'/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 2627 ms.
Running link step : cd /tmp/ltsmin1808593953580830237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin1808593953580830237;'/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/stateBased657819052091686239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 17 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-18 19:28:25] [INFO ] Invariant cache hit.
[2023-03-18 19:28:25] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-18 19:28:25] [INFO ] Invariant cache hit.
[2023-03-18 19:28:26] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2023-03-18 19:28:26] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-18 19:28:26] [INFO ] Invariant cache hit.
[2023-03-18 19:28:26] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1372 ms. Remains : 703/703 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin17040037108997840550
[2023-03-18 19:28:26] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2023-03-18 19:28:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:28:26] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2023-03-18 19:28:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:28:26] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2023-03-18 19:28:26] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:28:26] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17040037108997840550
Running compilation step : cd /tmp/ltsmin17040037108997840550;'/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 2535 ms.
Running link step : cd /tmp/ltsmin17040037108997840550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin17040037108997840550;'/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/stateBased13363560055378964396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 19:28:41] [INFO ] Flatten gal took : 24 ms
[2023-03-18 19:28:41] [INFO ] Flatten gal took : 23 ms
[2023-03-18 19:28:41] [INFO ] Time to serialize gal into /tmp/LTL3619332695839580921.gal : 6 ms
[2023-03-18 19:28:41] [INFO ] Time to serialize properties into /tmp/LTL17770115764639146393.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/LTL3619332695839580921.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3899208895037908625.hoa' '-atoms' '/tmp/LTL17770115764639146393.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/LTL17770115764639146393.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3899208895037908625.hoa
Detected timeout of ITS tools.
[2023-03-18 19:28:57] [INFO ] Flatten gal took : 41 ms
[2023-03-18 19:28:57] [INFO ] Flatten gal took : 36 ms
[2023-03-18 19:28:57] [INFO ] Time to serialize gal into /tmp/LTL10168829997582094969.gal : 6 ms
[2023-03-18 19:28:57] [INFO ] Time to serialize properties into /tmp/LTL424158252531704529.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/LTL10168829997582094969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL424158252531704529.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 : !((F(G("(p1666!=1)"))))
Formula 0 simplified : GF!"(p1666!=1)"
Detected timeout of ITS tools.
[2023-03-18 19:29:12] [INFO ] Flatten gal took : 63 ms
[2023-03-18 19:29:12] [INFO ] Applying decomposition
[2023-03-18 19:29:12] [INFO ] Flatten gal took : 48 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/graph17357395497947976059.txt' '-o' '/tmp/graph17357395497947976059.bin' '-w' '/tmp/graph17357395497947976059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17357395497947976059.bin' '-l' '-1' '-v' '-w' '/tmp/graph17357395497947976059.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:29:12] [INFO ] Decomposing Gal with order
[2023-03-18 19:29:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:29:12] [INFO ] Removed a total of 1045 redundant transitions.
[2023-03-18 19:29:12] [INFO ] Flatten gal took : 51 ms
[2023-03-18 19:29:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 956 labels/synchronizations in 12 ms.
[2023-03-18 19:29:12] [INFO ] Time to serialize gal into /tmp/LTL11317379098531896672.gal : 6 ms
[2023-03-18 19:29:12] [INFO ] Time to serialize properties into /tmp/LTL5658786276191448197.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/LTL11317379098531896672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5658786276191448197.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("(i12.u166.p1666!=1)"))))
Formula 0 simplified : GF!"(i12.u166.p1666!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9566776848568559819
[2023-03-18 19:29:27] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9566776848568559819
Running compilation step : cd /tmp/ltsmin9566776848568559819;'/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 1754 ms.
Running link step : cd /tmp/ltsmin9566776848568559819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin9566776848568559819;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050B-LTLFireability-14 finished in 99047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((p1||X(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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' '!(G(F((p0||G(F(p1))||G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 19:29:43] [INFO ] Flatten gal took : 87 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9481563767041057259
[2023-03-18 19:29:43] [INFO ] Too many transitions (1913) to apply POR reductions. Disabling POR matrices.
[2023-03-18 19:29:43] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9481563767041057259
Running compilation step : cd /tmp/ltsmin9481563767041057259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' '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 19:29:43] [INFO ] Applying decomposition
[2023-03-18 19:29:43] [INFO ] Flatten gal took : 71 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/graph4223005001999062797.txt' '-o' '/tmp/graph4223005001999062797.bin' '-w' '/tmp/graph4223005001999062797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4223005001999062797.bin' '-l' '-1' '-v' '-w' '/tmp/graph4223005001999062797.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:29:43] [INFO ] Decomposing Gal with order
[2023-03-18 19:29:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:29:43] [INFO ] Removed a total of 1791 redundant transitions.
[2023-03-18 19:29:43] [INFO ] Flatten gal took : 95 ms
[2023-03-18 19:29:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-18 19:29:43] [INFO ] Time to serialize gal into /tmp/LTLFireability9481160684254844616.gal : 16 ms
[2023-03-18 19:29:43] [INFO ] Time to serialize properties into /tmp/LTLFireability10621581338406139261.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/LTLFireability9481160684254844616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10621581338406139261.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 5 LTL properties
Checking formula 0 : !((F((G("(i12.u340.p1077==1)"))||(G("(((i10.u304.p956==0)||(i11.u316.p997==0))||(i11.u323.p1024==0))")))))
Formula 0 simplified : G(F!"(i12.u340.p1077==1)" & F!"(((i10.u304.p956==0)||(i11.u316.p997==0))||(i11.u323.p1024==0))")
Compilation finished in 4066 ms.
Running link step : cd /tmp/ltsmin9481563767041057259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin9481563767041057259;'/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' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin9481563767041057259;'/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' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9481563767041057259;'/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' '[](([]((LTLAPp2==true))||X(((LTLAPp3==true)||X((LTLAPp4==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2023-03-18 19:51:55] [INFO ] Applying decomposition
[2023-03-18 19:51:57] [INFO ] Flatten gal took : 1016 ms
[2023-03-18 19:51:57] [INFO ] Decomposing Gal with order
[2023-03-18 19:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:51:59] [INFO ] Removed a total of 1047 redundant transitions.
[2023-03-18 19:51:59] [INFO ] Flatten gal took : 1163 ms
[2023-03-18 19:52:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1592 labels/synchronizations in 311 ms.
[2023-03-18 19:52:01] [INFO ] Time to serialize gal into /tmp/LTLFireability10340210423567370705.gal : 86 ms
[2023-03-18 19:52:01] [INFO ] Time to serialize properties into /tmp/LTLFireability17952271424245134728.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/LTLFireability10340210423567370705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17952271424245134728.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...278
Read 5 LTL properties
Checking formula 0 : !((F((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u236.p1077==1)"))||(G("(((i0.i0.i0.i0.i0.i0.i0...438
Formula 0 simplified : G(F!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u236.p1077==1)" & F!"(((i0.i0.i0.i0.i0.i0.i0.i0....430
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.052: LTL layer: formula: [](([]((LTLAPp2==true))||X(((LTLAPp3==true)||X((LTLAPp4==true))))))
pins2lts-mc-linux64( 2/ 8), 0.052: "[](([]((LTLAPp2==true))||X(((LTLAPp3==true)||X((LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.052: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.151: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.752: DFS-FIFO for weak LTL, using special progress label 1924
pins2lts-mc-linux64( 0/ 8), 0.752: There are 1925 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.752: State length is 1664, there are 1942 groups
pins2lts-mc-linux64( 0/ 8), 0.752: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.752: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.752: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.752: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.876: ~1 levels ~960 states ~4888 transitions
pins2lts-mc-linux64( 2/ 8), 1.036: ~1 levels ~1920 states ~10520 transitions
pins2lts-mc-linux64( 2/ 8), 1.300: ~1 levels ~3840 states ~22000 transitions
pins2lts-mc-linux64( 2/ 8), 1.800: ~1 levels ~7680 states ~47616 transitions
pins2lts-mc-linux64( 2/ 8), 2.775: ~1 levels ~15360 states ~104768 transitions
pins2lts-mc-linux64( 2/ 8), 4.550: ~1 levels ~30720 states ~225104 transitions
pins2lts-mc-linux64( 2/ 8), 8.193: ~1 levels ~61440 states ~490008 transitions
pins2lts-mc-linux64( 2/ 8), 15.189: ~1 levels ~122880 states ~1064008 transitions
pins2lts-mc-linux64( 6/ 8), 29.083: ~1 levels ~245760 states ~2376392 transitions
pins2lts-mc-linux64( 2/ 8), 56.660: ~1 levels ~491520 states ~4813080 transitions
pins2lts-mc-linux64( 6/ 8), 112.391: ~1 levels ~983040 states ~10359328 transitions
pins2lts-mc-linux64( 6/ 8), 226.948: ~1 levels ~1966080 states ~21516384 transitions
pins2lts-mc-linux64( 6/ 8), 456.162: ~1 levels ~3932160 states ~44428712 transitions
pins2lts-mc-linux64( 4/ 8), 681.551: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 681.867:
pins2lts-mc-linux64( 0/ 8), 681.867: mean standard work distribution: 4.1% (states) 6.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 681.867:
pins2lts-mc-linux64( 0/ 8), 681.867: Explored 5515274 states 67660329 transitions, fanout: 12.268
pins2lts-mc-linux64( 0/ 8), 681.867: Total exploration time 681.090 sec (680.820 sec minimum, 680.943 sec on average)
pins2lts-mc-linux64( 0/ 8), 681.867: States per second: 8098, Transitions per second: 99341
pins2lts-mc-linux64( 0/ 8), 681.867:
pins2lts-mc-linux64( 0/ 8), 681.867: Progress states detected: 13521618
pins2lts-mc-linux64( 0/ 8), 681.867: Redundant explorations: -59.2115
pins2lts-mc-linux64( 0/ 8), 681.867:
pins2lts-mc-linux64( 0/ 8), 681.867: Queue width: 8B, total height: 12757744, memory: 97.33MB
pins2lts-mc-linux64( 0/ 8), 681.867: Tree memory: 359.2MB, 27.9 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 681.867: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 681.868: Stored 1992 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 681.887: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 681.887: Est. total memory use: 456.5MB (~1121.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9481563767041057259;'/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' '[](([]((LTLAPp2==true))||X(((LTLAPp3==true)||X((LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9481563767041057259;'/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' '[](([]((LTLAPp2==true))||X(((LTLAPp3==true)||X((LTLAPp4==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 20:15:30] [INFO ] Flatten gal took : 258 ms
[2023-03-18 20:15:31] [INFO ] Input system was already deterministic with 1913 transitions.
[2023-03-18 20:15:32] [INFO ] Transformed 1663 places.
[2023-03-18 20:15:32] [INFO ] Transformed 1913 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 20:15:32] [INFO ] Time to serialize gal into /tmp/LTLFireability1356509563795365998.gal : 20 ms
[2023-03-18 20:15:32] [INFO ] Time to serialize properties into /tmp/LTLFireability14728348125428599791.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/LTLFireability1356509563795365998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14728348125428599791.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...343
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(p1077==1)"))||(G("(((p956==0)||(p997==0))||(p1024==0))")))))
Formula 0 simplified : G(F!"(p1077==1)" & F!"(((p956==0)||(p997==0))||(p1024==0))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10522856 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16237480 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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 r421-tajo-167905974900156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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