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-167905974800124.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-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 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.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 370K 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-030B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679163520705

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-030B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 18:18:42] [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 18:18:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:18:42] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-18 18:18:42] [INFO ] Transformed 1203 places.
[2023-03-18 18:18:42] [INFO ] Transformed 1353 transitions.
[2023-03-18 18:18:42] [INFO ] Found NUPN structural information;
[2023-03-18 18:18:42] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-030B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 203 place count 1000 transition count 1150
Iterating global reduction 0 with 203 rules applied. Total rules applied 406 place count 1000 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 407 place count 999 transition count 1149
Iterating global reduction 0 with 1 rules applied. Total rules applied 408 place count 999 transition count 1149
Applied a total of 408 rules in 188 ms. Remains 999 /1203 variables (removed 204) and now considering 1149/1353 (removed 204) transitions.
// Phase 1: matrix 1149 rows 999 cols
[2023-03-18 18:18:42] [INFO ] Computed 121 place invariants in 28 ms
[2023-03-18 18:18:43] [INFO ] Implicit Places using invariants in 720 ms returned []
[2023-03-18 18:18:43] [INFO ] Invariant cache hit.
[2023-03-18 18:18:44] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2023-03-18 18:18:44] [INFO ] Invariant cache hit.
[2023-03-18 18:18:44] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 999/1203 places, 1149/1353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2207 ms. Remains : 999/1203 places, 1149/1353 transitions.
Support contains 53 out of 999 places after structural reductions.
[2023-03-18 18:18:45] [INFO ] Flatten gal took : 119 ms
[2023-03-18 18:18:45] [INFO ] Flatten gal took : 57 ms
[2023-03-18 18:18:45] [INFO ] Input system was already deterministic with 1149 transitions.
Support contains 48 out of 999 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 18:18:46] [INFO ] Invariant cache hit.
[2023-03-18 18:18:46] [INFO ] [Real]Absence check using 121 positive place invariants in 38 ms returned sat
[2023-03-18 18:18:46] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 18:18:46] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-18 18:18:47] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 18:18:47] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 4 ms to minimize.
[2023-03-18 18:18:47] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-18 18:18:47] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2023-03-18 18:18:48] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 1 ms to minimize.
[2023-03-18 18:18:48] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 1 ms to minimize.
[2023-03-18 18:18:48] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 1 ms to minimize.
[2023-03-18 18:18:48] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 2 ms to minimize.
[2023-03-18 18:18:49] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 1 ms to minimize.
[2023-03-18 18:18:49] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 1 ms to minimize.
[2023-03-18 18:18:49] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2023-03-18 18:18:49] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 1 ms to minimize.
[2023-03-18 18:18:49] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2023-03-18 18:18:49] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 1 ms to minimize.
[2023-03-18 18:18:50] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 1 ms to minimize.
[2023-03-18 18:18:50] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2023-03-18 18:18:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3010 ms
[2023-03-18 18:18:50] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2023-03-18 18:18:50] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2023-03-18 18:18:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-03-18 18:18:50] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2023-03-18 18:18:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-18 18:18:51] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2023-03-18 18:18:51] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2023-03-18 18:18:51] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 13 ms to minimize.
[2023-03-18 18:18:51] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 0 ms to minimize.
[2023-03-18 18:18:51] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 0 ms to minimize.
[2023-03-18 18:18:51] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2023-03-18 18:18:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 832 ms
[2023-03-18 18:18:51] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2023-03-18 18:18:52] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2023-03-18 18:18:52] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2023-03-18 18:18:52] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2023-03-18 18:18:52] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2023-03-18 18:18:52] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2023-03-18 18:18:52] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2023-03-18 18:18:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1160 ms
[2023-03-18 18:18:53] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 1 ms to minimize.
[2023-03-18 18:18:53] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2023-03-18 18:18:53] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 4 ms to minimize.
[2023-03-18 18:18:53] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2023-03-18 18:18:53] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-03-18 18:18:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 943 ms
[2023-03-18 18:18:53] [INFO ] After 7180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 397 ms.
[2023-03-18 18:18:54] [INFO ] After 7860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 476 ms.
Support contains 14 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 999 transition count 1031
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 881 transition count 1031
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 236 place count 881 transition count 881
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 536 place count 731 transition count 881
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 539 place count 728 transition count 878
Iterating global reduction 2 with 3 rules applied. Total rules applied 542 place count 728 transition count 878
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1138 place count 430 transition count 580
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 2 with 59 rules applied. Total rules applied 1197 place count 430 transition count 580
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1198 place count 429 transition count 579
Applied a total of 1198 rules in 225 ms. Remains 429 /999 variables (removed 570) and now considering 579/1149 (removed 570) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 429/999 places, 579/1149 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 579 rows 429 cols
[2023-03-18 18:18:55] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:18:55] [INFO ] [Real]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-18 18:18:55] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:18:55] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-18 18:18:55] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:18:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-18 18:18:56] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-18 18:18:56] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2023-03-18 18:18:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-18 18:18:56] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 18:18:56] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 579/579 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 428 transition count 578
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 428 transition count 576
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 6 place count 426 transition count 576
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 423 transition count 573
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 423 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 422 transition count 572
Applied a total of 15 rules in 119 ms. Remains 422 /429 variables (removed 7) and now considering 572/579 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 422/429 places, 572/579 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 485984 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485984 steps, saw 176186 distinct states, run finished after 3003 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 572 rows 422 cols
[2023-03-18 18:18:59] [INFO ] Computed 121 place invariants in 9 ms
[2023-03-18 18:18:59] [INFO ] [Real]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-18 18:18:59] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:18:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-18 18:18:59] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:00] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-18 18:19:00] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-18 18:19:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-18 18:19:00] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-18 18:19:00] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 22 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 422/422 places, 572/572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 20 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-18 18:19:00] [INFO ] Invariant cache hit.
[2023-03-18 18:19:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-18 18:19:00] [INFO ] Invariant cache hit.
[2023-03-18 18:19:00] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2023-03-18 18:19:00] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-18 18:19:00] [INFO ] Invariant cache hit.
[2023-03-18 18:19:01] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1050 ms. Remains : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 25 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 18:19:01] [INFO ] Invariant cache hit.
[2023-03-18 18:19:01] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-18 18:19:01] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:19:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-18 18:19:01] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:01] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2023-03-18 18:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-18 18:19:01] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 18:19:01] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldRVs-PT-030B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 242 stabilizing places and 242 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((X(p2)||p1))))))'
Support contains 5 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 993 transition count 1143
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 993 transition count 1143
Applied a total of 12 rules in 47 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-18 18:19:02] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-18 18:19:02] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-18 18:19:02] [INFO ] Invariant cache hit.
[2023-03-18 18:19:03] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2023-03-18 18:19:03] [INFO ] Invariant cache hit.
[2023-03-18 18:19:04] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/999 places, 1143/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1944 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s508 1), p1:(OR (EQ s748 0) (EQ s751 0) (EQ s758 0)), p2:(EQ s126 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-00 finished in 2290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&F(p2)&&p0))))'
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 40 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-18 18:19:04] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-18 18:19:04] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-18 18:19:04] [INFO ] Invariant cache hit.
[2023-03-18 18:19:05] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2023-03-18 18:19:05] [INFO ] Invariant cache hit.
[2023-03-18 18:19:05] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1501 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s468 1) (EQ s477 1) (EQ s498 1)), p1:(AND (EQ s468 1) (EQ s477 1) (EQ s498 1)), p2:(AND (EQ s459 1) (EQ s462 1) (EQ s469 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1276 steps with 0 reset in 19 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-01 finished in 1698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U G(p2))))'
Support contains 5 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 993 transition count 1143
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 993 transition count 1143
Applied a total of 12 rules in 46 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-18 18:19:06] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-18 18:19:06] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-18 18:19:06] [INFO ] Invariant cache hit.
[2023-03-18 18:19:07] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-18 18:19:07] [INFO ] Invariant cache hit.
[2023-03-18 18:19:07] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/999 places, 1143/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1771 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s237 1), p0:(AND (EQ s75 1) (EQ s78 1) (EQ s85 1)), p1:(NEQ s387 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 76 reset in 588 ms.
Product exploration explored 100000 steps with 77 reset in 630 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Detected a total of 240/993 stabilizing places and 240/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 474 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:19:09] [INFO ] Invariant cache hit.
[2023-03-18 18:19:10] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-18 18:19:10] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:19:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-18 18:19:11] [INFO ] After 489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:11] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2023-03-18 18:19:11] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 0 ms to minimize.
[2023-03-18 18:19:11] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2023-03-18 18:19:12] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2023-03-18 18:19:12] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2023-03-18 18:19:12] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2023-03-18 18:19:12] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 0 ms to minimize.
[2023-03-18 18:19:12] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2023-03-18 18:19:13] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 1 ms to minimize.
[2023-03-18 18:19:13] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2023-03-18 18:19:13] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 1 ms to minimize.
[2023-03-18 18:19:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2176 ms
[2023-03-18 18:19:13] [INFO ] After 2704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-18 18:19:13] [INFO ] After 2958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 993 transition count 1024
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 874 transition count 1024
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 238 place count 874 transition count 874
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 538 place count 724 transition count 874
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 539 place count 723 transition count 873
Iterating global reduction 2 with 1 rules applied. Total rules applied 540 place count 723 transition count 873
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1136 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1198 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1199 place count 424 transition count 574
Applied a total of 1199 rules in 78 ms. Remains 424 /993 variables (removed 569) and now considering 574/1143 (removed 569) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 424/993 places, 574/1143 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 434226 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 434226 steps, saw 270875 distinct states, run finished after 3004 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-18 18:19:16] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-18 18:19:16] [INFO ] [Real]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-18 18:19:17] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:19:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-18 18:19:17] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:17] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-18 18:19:17] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-18 18:19:17] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-18 18:19:17] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2023-03-18 18:19:17] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-18 18:19:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 445 ms
[2023-03-18 18:19:17] [INFO ] After 648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 18:19:17] [INFO ] After 794ms 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 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 16 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 16 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-18 18:19:17] [INFO ] Invariant cache hit.
[2023-03-18 18:19:18] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-18 18:19:18] [INFO ] Invariant cache hit.
[2023-03-18 18:19:18] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2023-03-18 18:19:18] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-18 18:19:18] [INFO ] Invariant cache hit.
[2023-03-18 18:19:19] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1239 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 18:19:19] [INFO ] Invariant cache hit.
[2023-03-18 18:19:19] [INFO ] [Real]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-18 18:19:19] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:19:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-18 18:19:19] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-18 18:19:19] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2023-03-18 18:19:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-18 18:19:20] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2023-03-18 18:19:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 294 ms
[2023-03-18 18:19:20] [INFO ] After 442ms 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 18:19:20] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 397 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 1143 rows 993 cols
[2023-03-18 18:19:20] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-18 18:19:21] [INFO ] [Real]Absence check using 121 positive place invariants in 114 ms returned sat
[2023-03-18 18:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:19:23] [INFO ] [Real]Absence check using state equation in 2104 ms returned sat
[2023-03-18 18:19:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:19:23] [INFO ] [Nat]Absence check using 121 positive place invariants in 59 ms returned sat
[2023-03-18 18:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:19:25] [INFO ] [Nat]Absence check using state equation in 1892 ms returned sat
[2023-03-18 18:19:25] [INFO ] Computed and/alt/rep : 1142/3615/1142 causal constraints (skipped 0 transitions) in 108 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:19:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 5 out of 993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 992 transition count 1023
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 873 transition count 1023
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 238 place count 873 transition count 874
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 536 place count 724 transition count 874
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 0 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1128 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 426 transition count 576
Applied a total of 1130 rules in 152 ms. Remains 426 /993 variables (removed 567) and now considering 576/1143 (removed 567) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-18 18:19:38] [INFO ] Computed 121 place invariants in 19 ms
[2023-03-18 18:19:38] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-18 18:19:38] [INFO ] Invariant cache hit.
[2023-03-18 18:19:39] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2023-03-18 18:19:39] [INFO ] Redundant transitions in 85 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2023-03-18 18:19:39] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:19:39] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/993 places, 575/1143 transitions.
Applied a total of 0 rules in 11 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1362 ms. Remains : 426/993 places, 575/1143 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:19:40] [INFO ] Invariant cache hit.
[2023-03-18 18:19:40] [INFO ] [Real]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-18 18:19:40] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:19:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-18 18:19:40] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:40] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2023-03-18 18:19:40] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-18 18:19:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-18 18:19:40] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 18:19:41] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 575/575 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 425 transition count 574
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 573
Applied a total of 65 rules in 49 ms. Remains 424 /426 variables (removed 2) and now considering 573/575 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 424/426 places, 573/575 transitions.
Incomplete random walk after 10000 steps, including 27 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 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 450925 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 450925 steps, saw 269292 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 573 rows 424 cols
[2023-03-18 18:19:44] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-18 18:19:44] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:19:44] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:19:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-18 18:19:44] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:44] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-03-18 18:19:44] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-18 18:19:45] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-03-18 18:19:45] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-18 18:19:45] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-03-18 18:19:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 489 ms
[2023-03-18 18:19:45] [INFO ] After 679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 18:19:45] [INFO ] After 793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 21 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 424/424 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-18 18:19:45] [INFO ] Invariant cache hit.
[2023-03-18 18:19:45] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-18 18:19:45] [INFO ] Invariant cache hit.
[2023-03-18 18:19:46] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2023-03-18 18:19:46] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-18 18:19:46] [INFO ] Invariant cache hit.
[2023-03-18 18:19:46] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 997 ms. Remains : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 12 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 18:19:46] [INFO ] Invariant cache hit.
[2023-03-18 18:19:46] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:19:46] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:19:46] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-18 18:19:46] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:19:46] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-18 18:19:46] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 483 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 575 rows 426 cols
[2023-03-18 18:19:47] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 18:19:47] [INFO ] [Real]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-18 18:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:19:48] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-18 18:19:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:19:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-18 18:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:19:48] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2023-03-18 18:19:48] [INFO ] Computed and/alt/rep : 503/2158/503 causal constraints (skipped 68 transitions) in 26 ms.
[2023-03-18 18:19:54] [INFO ] Added : 478 causal constraints over 96 iterations in 5756 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 244 reset in 551 ms.
Product exploration explored 100000 steps with 244 reset in 572 ms.
Built C files in :
/tmp/ltsmin10885625145183201137
[2023-03-18 18:19:55] [INFO ] Computing symmetric may disable matrix : 575 transitions.
[2023-03-18 18:19:55] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:19:55] [INFO ] Computing symmetric may enable matrix : 575 transitions.
[2023-03-18 18:19:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:19:55] [INFO ] Computing Do-Not-Accords matrix : 575 transitions.
[2023-03-18 18:19:55] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:19:55] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10885625145183201137
Running compilation step : cd /tmp/ltsmin10885625145183201137;'/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 1369 ms.
Running link step : cd /tmp/ltsmin10885625145183201137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10885625145183201137;'/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/stateBased4997464031195648165.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 575/575 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-18 18:20:10] [INFO ] Invariant cache hit.
[2023-03-18 18:20:11] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-18 18:20:11] [INFO ] Invariant cache hit.
[2023-03-18 18:20:11] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-18 18:20:11] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-18 18:20:11] [INFO ] Invariant cache hit.
[2023-03-18 18:20:11] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 974 ms. Remains : 426/426 places, 575/575 transitions.
Built C files in :
/tmp/ltsmin10836861574457501711
[2023-03-18 18:20:11] [INFO ] Computing symmetric may disable matrix : 575 transitions.
[2023-03-18 18:20:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:20:11] [INFO ] Computing symmetric may enable matrix : 575 transitions.
[2023-03-18 18:20:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:20:12] [INFO ] Computing Do-Not-Accords matrix : 575 transitions.
[2023-03-18 18:20:12] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:20:12] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10836861574457501711
Running compilation step : cd /tmp/ltsmin10836861574457501711;'/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 1146 ms.
Running link step : cd /tmp/ltsmin10836861574457501711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin10836861574457501711;'/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/stateBased16807474639354520581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:20:27] [INFO ] Flatten gal took : 54 ms
[2023-03-18 18:20:27] [INFO ] Flatten gal took : 51 ms
[2023-03-18 18:20:27] [INFO ] Time to serialize gal into /tmp/LTL16126981195066321065.gal : 17 ms
[2023-03-18 18:20:27] [INFO ] Time to serialize properties into /tmp/LTL4104016017362234543.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/LTL16126981195066321065.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16005906853632805190.hoa' '-atoms' '/tmp/LTL4104016017362234543.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/LTL4104016017362234543.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16005906853632805190.hoa
Detected timeout of ITS tools.
[2023-03-18 18:20:42] [INFO ] Flatten gal took : 42 ms
[2023-03-18 18:20:42] [INFO ] Flatten gal took : 31 ms
[2023-03-18 18:20:42] [INFO ] Time to serialize gal into /tmp/LTL16755723927935949091.gal : 6 ms
[2023-03-18 18:20:42] [INFO ] Time to serialize properties into /tmp/LTL4089964319348933372.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/LTL16755723927935949091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4089964319348933372.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(((p83==1)&&(p88==1))&&(p96==1))"))||(G("(p463!=1)"))))U(G("(p281==1)")))))
Formula 0 simplified : X(G(F!"(((p83==1)&&(p88==1))&&(p96==1))" & F!"(p463!=1)") R F!"(p281==1)")
Detected timeout of ITS tools.
[2023-03-18 18:20:57] [INFO ] Flatten gal took : 49 ms
[2023-03-18 18:20:57] [INFO ] Applying decomposition
[2023-03-18 18:20:57] [INFO ] Flatten gal took : 36 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/graph12377344318392971728.txt' '-o' '/tmp/graph12377344318392971728.bin' '-w' '/tmp/graph12377344318392971728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12377344318392971728.bin' '-l' '-1' '-v' '-w' '/tmp/graph12377344318392971728.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:20:57] [INFO ] Decomposing Gal with order
[2023-03-18 18:20:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:20:57] [INFO ] Removed a total of 631 redundant transitions.
[2023-03-18 18:20:58] [INFO ] Flatten gal took : 92 ms
[2023-03-18 18:20:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 670 labels/synchronizations in 20 ms.
[2023-03-18 18:20:58] [INFO ] Time to serialize gal into /tmp/LTL12900042519108165772.gal : 8 ms
[2023-03-18 18:20:58] [INFO ] Time to serialize properties into /tmp/LTL2875356060007567334.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/LTL12900042519108165772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2875356060007567334.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 : !((X((F((G("(((i0.i1.u6.p83==1)&&(i0.i1.u7.p88==1))&&(i0.i1.u8.p96==1))"))||(G("(i4.i1.u46.p463!=1)"))))U(G("(i2.i1.u27.p281==1)")))))
Formula 0 simplified : X(G(F!"(((i0.i1.u6.p83==1)&&(i0.i1.u7.p88==1))&&(i0.i1.u8.p96==1))" & F!"(i4.i1.u46.p463!=1)") R F!"(i2.i1.u27.p281==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18121176302117718018
[2023-03-18 18:21:13] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18121176302117718018
Running compilation step : cd /tmp/ltsmin18121176302117718018;'/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 1080 ms.
Running link step : cd /tmp/ltsmin18121176302117718018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin18121176302117718018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 142135 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(X((p0||X(X(X(F(p1))))||G(p2))))))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 993 transition count 1143
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 993 transition count 1143
Applied a total of 12 rules in 66 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-18 18:21:28] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-18 18:21:28] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-18 18:21:28] [INFO ] Invariant cache hit.
[2023-03-18 18:21:29] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-03-18 18:21:29] [INFO ] Invariant cache hit.
[2023-03-18 18:21:29] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/999 places, 1143/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1577 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=true, acceptance={} source=9 dest: 8}]], initial=9, aps=[p1:(EQ s255 0), p2:(EQ s417 1), p0:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14285 reset in 273 ms.
Product exploration explored 100000 steps with 14285 reset in 324 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:21:31] [INFO ] Invariant cache hit.
[2023-03-18 18:21:31] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:21:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-18 18:21:32] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:21:32] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2023-03-18 18:21:32] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 0 ms to minimize.
[2023-03-18 18:21:33] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 1 ms to minimize.
[2023-03-18 18:21:33] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 0 ms to minimize.
[2023-03-18 18:21:33] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2023-03-18 18:21:33] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 0 ms to minimize.
[2023-03-18 18:21:34] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 0 ms to minimize.
[2023-03-18 18:21:34] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2023-03-18 18:21:34] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2023-03-18 18:21:34] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 0 ms to minimize.
[2023-03-18 18:21:35] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 0 ms to minimize.
[2023-03-18 18:21:35] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 0 ms to minimize.
[2023-03-18 18:21:35] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 4 ms to minimize.
[2023-03-18 18:21:35] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 0 ms to minimize.
[2023-03-18 18:21:36] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 11 ms to minimize.
[2023-03-18 18:21:36] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 0 ms to minimize.
[2023-03-18 18:21:36] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 0 ms to minimize.
[2023-03-18 18:21:36] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2023-03-18 18:21:36] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 1 ms to minimize.
[2023-03-18 18:21:37] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 1 ms to minimize.
[2023-03-18 18:21:37] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2023-03-18 18:21:37] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 1 ms to minimize.
[2023-03-18 18:21:37] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 1 ms to minimize.
[2023-03-18 18:21:37] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 1 ms to minimize.
[2023-03-18 18:21:38] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 1 ms to minimize.
[2023-03-18 18:21:38] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 0 ms to minimize.
[2023-03-18 18:21:38] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 1 ms to minimize.
[2023-03-18 18:21:38] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 1 ms to minimize.
[2023-03-18 18:21:38] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 13 ms to minimize.
[2023-03-18 18:21:39] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 1 ms to minimize.
[2023-03-18 18:21:39] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 1 ms to minimize.
[2023-03-18 18:21:39] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 0 ms to minimize.
[2023-03-18 18:21:39] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7187 ms
[2023-03-18 18:21:39] [INFO ] After 7733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-18 18:21:39] [INFO ] After 7985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 993 transition count 1023
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 873 transition count 1023
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 873 transition count 874
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 724 transition count 874
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 539 place count 723 transition count 873
Iterating global reduction 2 with 1 rules applied. Total rules applied 540 place count 723 transition count 873
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 1 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1138 place count 424 transition count 574
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 2 with 61 rules applied. Total rules applied 1199 place count 424 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1200 place count 423 transition count 573
Applied a total of 1200 rules in 91 ms. Remains 423 /993 variables (removed 570) and now considering 573/1143 (removed 570) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 423/993 places, 573/1143 transitions.
Finished random walk after 249 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND p2 (NOT p0))), (F p2)]
Knowledge based reduction with 2 factoid took 299 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 461 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 468 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Applied a total of 0 rules in 27 ms. Remains 993 /993 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2023-03-18 18:21:40] [INFO ] Invariant cache hit.
[2023-03-18 18:21:41] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-18 18:21:41] [INFO ] Invariant cache hit.
[2023-03-18 18:21:42] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-18 18:21:42] [INFO ] Invariant cache hit.
[2023-03-18 18:21:42] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1679 ms. Remains : 993/993 places, 1143/1143 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 3589 steps, including 2 resets, run visited all 6 properties in 20 ms. (steps per millisecond=179 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND p2 (NOT p0))), (F p2)]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 408 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 14285 reset in 388 ms.
Product exploration explored 100000 steps with 14285 reset in 365 ms.
Applying partial POR strategy [true, false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 993 transition count 1143
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 119 place count 993 transition count 1172
Deduced a syphon composed of 179 places in 2 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 179 place count 993 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 992 transition count 1171
Deduced a syphon composed of 178 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 992 transition count 1171
Performed 389 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 1 with 389 rules applied. Total rules applied 570 place count 992 transition count 1171
Renaming transitions due to excessive name length > 1024 char.
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 778 place count 784 transition count 963
Deduced a syphon composed of 359 places in 1 ms
Iterating global reduction 1 with 208 rules applied. Total rules applied 986 place count 784 transition count 963
Deduced a syphon composed of 359 places in 1 ms
Applied a total of 986 rules in 395 ms. Remains 784 /993 variables (removed 209) and now considering 963/1143 (removed 180) transitions.
[2023-03-18 18:21:46] [INFO ] Redundant transitions in 422 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 784 cols
[2023-03-18 18:21:46] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-18 18:21:46] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 784/993 places, 962/1143 transitions.
Deduced a syphon composed of 359 places in 1 ms
Applied a total of 0 rules in 17 ms. Remains 784 /784 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1334 ms. Remains : 784/993 places, 962/1143 transitions.
Built C files in :
/tmp/ltsmin1786432694459592077
[2023-03-18 18:21:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1786432694459592077
Running compilation step : cd /tmp/ltsmin1786432694459592077;'/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 1838 ms.
Running link step : cd /tmp/ltsmin1786432694459592077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1786432694459592077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15720404207829268594.hoa' '--buchi-type=spotba'
LTSmin run took 972 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-030B-LTLFireability-05 finished in 21428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 30 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-18 18:21:49] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 18:21:49] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-18 18:21:49] [INFO ] Invariant cache hit.
[2023-03-18 18:21:50] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2023-03-18 18:21:50] [INFO ] Invariant cache hit.
[2023-03-18 18:21:51] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1720 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s939 1) (EQ s942 1) (EQ s950 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-06 finished in 1856 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 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 50 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
[2023-03-18 18:21:51] [INFO ] Invariant cache hit.
[2023-03-18 18:21:51] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-18 18:21:51] [INFO ] Invariant cache hit.
[2023-03-18 18:21:52] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-18 18:21:52] [INFO ] Invariant cache hit.
[2023-03-18 18:21:53] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1781 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-07 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 s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 217 reset in 330 ms.
Product exploration explored 100000 steps with 215 reset in 501 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 367 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=183 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 148 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-18 18:21:54] [INFO ] Invariant cache hit.
[2023-03-18 18:21:55] [INFO ] [Real]Absence check using 121 positive place invariants in 58 ms returned sat
[2023-03-18 18:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:21:56] [INFO ] [Real]Absence check using state equation in 1890 ms returned sat
[2023-03-18 18:21:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:21:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 59 ms returned sat
[2023-03-18 18:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:21:59] [INFO ] [Nat]Absence check using state equation in 1624 ms returned sat
[2023-03-18 18:21:59] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 80 ms.
[2023-03-18 18:22:12] [INFO ] Deduced a trap composed of 14 places in 471 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:22:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 991 transition count 1021
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 871 transition count 1021
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 240 place count 871 transition count 870
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 542 place count 720 transition count 870
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1132 place count 425 transition count 575
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 1134 place count 423 transition count 573
Applied a total of 1134 rules in 75 ms. Remains 423 /992 variables (removed 569) and now considering 573/1142 (removed 569) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-18 18:22:12] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-18 18:22:12] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-18 18:22:12] [INFO ] Invariant cache hit.
[2023-03-18 18:22:13] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-18 18:22:13] [INFO ] Redundant transitions in 121 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2023-03-18 18:22:13] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-18 18:22:13] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/992 places, 572/1142 transitions.
Applied a total of 0 rules in 12 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1085 ms. Remains : 423/992 places, 572/1142 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/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 189 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 46 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 : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 225 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-18 18:22:14] [INFO ] Invariant cache hit.
[2023-03-18 18:22:14] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-18 18:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:22:14] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2023-03-18 18:22:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:22:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-18 18:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:22:15] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-18 18:22:15] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 33 ms.
[2023-03-18 18:22:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2023-03-18 18:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-18 18:22:20] [INFO ] Added : 483 causal constraints over 98 iterations in 5337 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27133 reset in 559 ms.
Product exploration explored 100000 steps with 27030 reset in 535 ms.
Built C files in :
/tmp/ltsmin14006176776550049377
[2023-03-18 18:22:22] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2023-03-18 18:22:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:22:22] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2023-03-18 18:22:22] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:22:22] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2023-03-18 18:22:22] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:22:22] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14006176776550049377
Running compilation step : cd /tmp/ltsmin14006176776550049377;'/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 1735 ms.
Running link step : cd /tmp/ltsmin14006176776550049377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin14006176776550049377;'/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/stateBased10539834009202843306.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 14 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-18 18:22:37] [INFO ] Invariant cache hit.
[2023-03-18 18:22:37] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-18 18:22:37] [INFO ] Invariant cache hit.
[2023-03-18 18:22:37] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-18 18:22:37] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-18 18:22:37] [INFO ] Invariant cache hit.
[2023-03-18 18:22:37] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 790 ms. Remains : 423/423 places, 572/572 transitions.
Built C files in :
/tmp/ltsmin5160367216230747342
[2023-03-18 18:22:37] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2023-03-18 18:22:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:22:37] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2023-03-18 18:22:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:22:37] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2023-03-18 18:22:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:22:37] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5160367216230747342
Running compilation step : cd /tmp/ltsmin5160367216230747342;'/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 1552 ms.
Running link step : cd /tmp/ltsmin5160367216230747342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin5160367216230747342;'/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/stateBased15918594985029168292.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:22:53] [INFO ] Flatten gal took : 26 ms
[2023-03-18 18:22:53] [INFO ] Flatten gal took : 23 ms
[2023-03-18 18:22:53] [INFO ] Time to serialize gal into /tmp/LTL17198342221466441186.gal : 6 ms
[2023-03-18 18:22:53] [INFO ] Time to serialize properties into /tmp/LTL6606645674302695856.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/LTL17198342221466441186.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1537212627531626011.hoa' '-atoms' '/tmp/LTL6606645674302695856.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/LTL6606645674302695856.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1537212627531626011.hoa
Detected timeout of ITS tools.
[2023-03-18 18:23:08] [INFO ] Flatten gal took : 18 ms
[2023-03-18 18:23:08] [INFO ] Flatten gal took : 18 ms
[2023-03-18 18:23:08] [INFO ] Time to serialize gal into /tmp/LTL16288766676047501641.gal : 3 ms
[2023-03-18 18:23:08] [INFO ] Time to serialize properties into /tmp/LTL3117513145842526311.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16288766676047501641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3117513145842526311.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(p230==1)"))))
Formula 0 simplified : XG!"(p230==1)"
Detected timeout of ITS tools.
[2023-03-18 18:23:23] [INFO ] Flatten gal took : 17 ms
[2023-03-18 18:23:23] [INFO ] Applying decomposition
[2023-03-18 18:23:23] [INFO ] Flatten gal took : 16 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/graph1087886492046716261.txt' '-o' '/tmp/graph1087886492046716261.bin' '-w' '/tmp/graph1087886492046716261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1087886492046716261.bin' '-l' '-1' '-v' '-w' '/tmp/graph1087886492046716261.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:23:23] [INFO ] Decomposing Gal with order
[2023-03-18 18:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:23:23] [INFO ] Removed a total of 625 redundant transitions.
[2023-03-18 18:23:23] [INFO ] Flatten gal took : 85 ms
[2023-03-18 18:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 692 labels/synchronizations in 22 ms.
[2023-03-18 18:23:23] [INFO ] Time to serialize gal into /tmp/LTL2681696606153965836.gal : 18 ms
[2023-03-18 18:23:23] [INFO ] Time to serialize properties into /tmp/LTL11984867752327512156.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/LTL2681696606153965836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11984867752327512156.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 : !((X(F("(i1.i2.u21.p230==1)"))))
Formula 0 simplified : XG!"(i1.i2.u21.p230==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin923741110835681708
[2023-03-18 18:23:38] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin923741110835681708
Running compilation step : cd /tmp/ltsmin923741110835681708;'/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 1240 ms.
Running link step : cd /tmp/ltsmin923741110835681708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin923741110835681708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 122230 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||(p1 U p2)))))'
Support contains 4 out of 999 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 994 transition count 1144
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 994 transition count 1144
Applied a total of 10 rules in 63 ms. Remains 994 /999 variables (removed 5) and now considering 1144/1149 (removed 5) transitions.
// Phase 1: matrix 1144 rows 994 cols
[2023-03-18 18:23:53] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-18 18:23:54] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-18 18:23:54] [INFO ] Invariant cache hit.
[2023-03-18 18:23:54] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2023-03-18 18:23:54] [INFO ] Invariant cache hit.
[2023-03-18 18:23:55] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 994/999 places, 1144/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1628 ms. Remains : 994/999 places, 1144/1149 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s809 0), p2:(AND (EQ s905 1) (EQ s939 1) (EQ s960 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 577 ms.
Product exploration explored 100000 steps with 50000 reset in 559 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-030B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-030B-LTLFireability-08 finished in 2983 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&&G((p1 U p2)))))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 998 transition count 1027
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 877 transition count 1027
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 877 transition count 877
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 727 transition count 877
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 549 place count 720 transition count 870
Iterating global reduction 2 with 7 rules applied. Total rules applied 556 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 720 transition count 869
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 558 place count 719 transition count 869
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1146 place count 425 transition count 575
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 1148 place count 423 transition count 573
Applied a total of 1148 rules in 131 ms. Remains 423 /999 variables (removed 576) and now considering 573/1149 (removed 576) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-18 18:23:56] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:23:57] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-18 18:23:57] [INFO ] Invariant cache hit.
[2023-03-18 18:23:57] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-18 18:23:57] [INFO ] Redundant transitions in 103 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2023-03-18 18:23:57] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-18 18:23:57] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/999 places, 572/1149 transitions.
Applied a total of 0 rules in 13 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1166 ms. Remains : 423/999 places, 572/1149 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s409 0), p2:(EQ s39 1), p1:(EQ s215 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 429 steps with 0 reset in 7 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-11 finished in 1356 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(X((p0&&X(p1))))))'
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 71 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-18 18:23:58] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-18 18:23:58] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-18 18:23:58] [INFO ] Invariant cache hit.
[2023-03-18 18:23:59] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2023-03-18 18:23:59] [INFO ] Invariant cache hit.
[2023-03-18 18:23:59] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1706 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}]], initial=9, aps=[p1:(EQ s344 1), p0:(EQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][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-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-12 finished in 2047 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)||(!p0&&F(p1)))))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 998 transition count 1028
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 878 transition count 1028
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 878 transition count 879
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 729 transition count 879
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 544 place count 723 transition count 873
Iterating global reduction 2 with 6 rules applied. Total rules applied 550 place count 723 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 550 place count 723 transition count 872
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1144 place count 426 transition count 576
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 1146 place count 424 transition count 574
Applied a total of 1146 rules in 103 ms. Remains 424 /999 variables (removed 575) and now considering 574/1149 (removed 575) transitions.
// Phase 1: matrix 574 rows 424 cols
[2023-03-18 18:24:00] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 18:24:00] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-18 18:24:00] [INFO ] Invariant cache hit.
[2023-03-18 18:24:00] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-03-18 18:24:01] [INFO ] Redundant transitions in 113 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2023-03-18 18:24:01] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 18:24:01] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/999 places, 573/1149 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1119 ms. Remains : 424/999 places, 573/1149 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s382 1) (EQ s301 1)), p1:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26998 reset in 520 ms.
Product exploration explored 100000 steps with 27305 reset in 514 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 82 ms. (steps per millisecond=121 ) 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.
[2023-03-18 18:24:03] [INFO ] Invariant cache hit.
[2023-03-18 18:24:03] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:24:03] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:24:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:24:03] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:24:03] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-18 18:24:03] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-18 18:24:03] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-18 18:24:03] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-18 18:24:03] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-18 18:24:04] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-18 18:24:04] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2023-03-18 18:24:04] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2023-03-18 18:24:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 876 ms
[2023-03-18 18:24:04] [INFO ] After 1087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 18:24:04] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 424 transition count 573
Applied a total of 61 rules in 26 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 424/424 places, 573/573 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished Best-First random walk after 630 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=210 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 369 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-18 18:24:05] [INFO ] Invariant cache hit.
[2023-03-18 18:24:05] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-18 18:24:05] [INFO ] Invariant cache hit.
[2023-03-18 18:24:05] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-18 18:24:05] [INFO ] Invariant cache hit.
[2023-03-18 18:24:06] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 424/424 places, 573/573 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:24:06] [INFO ] Invariant cache hit.
[2023-03-18 18:24:06] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-18 18:24:06] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:24:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-18 18:24:07] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:24:07] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2023-03-18 18:24:07] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2023-03-18 18:24:07] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-18 18:24:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2023-03-18 18:24:07] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-18 18:24:07] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 424 transition count 573
Applied a total of 61 rules in 27 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 424/424 places, 573/573 transitions.
Finished random walk after 1228 steps, including 3 resets, run visited all 1 properties in 9 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 27045 reset in 504 ms.
Product exploration explored 100000 steps with 27220 reset in 464 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-18 18:24:09] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-18 18:24:09] [INFO ] Invariant cache hit.
[2023-03-18 18:24:09] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 424/424 places, 573/573 transitions.
Built C files in :
/tmp/ltsmin15641873120052612054
[2023-03-18 18:24:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15641873120052612054
Running compilation step : cd /tmp/ltsmin15641873120052612054;'/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 913 ms.
Running link step : cd /tmp/ltsmin15641873120052612054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15641873120052612054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14753942258816957272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 13 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-18 18:24:24] [INFO ] Invariant cache hit.
[2023-03-18 18:24:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-18 18:24:25] [INFO ] Invariant cache hit.
[2023-03-18 18:24:25] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-18 18:24:25] [INFO ] Invariant cache hit.
[2023-03-18 18:24:25] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 424/424 places, 573/573 transitions.
Built C files in :
/tmp/ltsmin13318591526673804573
[2023-03-18 18:24:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13318591526673804573
Running compilation step : cd /tmp/ltsmin13318591526673804573;'/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 918 ms.
Running link step : cd /tmp/ltsmin13318591526673804573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13318591526673804573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13188370134072574159.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:24:40] [INFO ] Flatten gal took : 27 ms
[2023-03-18 18:24:40] [INFO ] Flatten gal took : 24 ms
[2023-03-18 18:24:40] [INFO ] Time to serialize gal into /tmp/LTL16153388308228637805.gal : 4 ms
[2023-03-18 18:24:40] [INFO ] Time to serialize properties into /tmp/LTL9591356850731640434.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/LTL16153388308228637805.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16256870339810276700.hoa' '-atoms' '/tmp/LTL9591356850731640434.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/LTL9591356850731640434.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16256870339810276700.hoa
Detected timeout of ITS tools.
[2023-03-18 18:24:56] [INFO ] Flatten gal took : 15 ms
[2023-03-18 18:24:56] [INFO ] Flatten gal took : 13 ms
[2023-03-18 18:24:56] [INFO ] Time to serialize gal into /tmp/LTL1377797112076831455.gal : 4 ms
[2023-03-18 18:24:56] [INFO ] Time to serialize properties into /tmp/LTL8860888354669291168.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/LTL1377797112076831455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8860888354669291168.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("((p1082!=1)||(p861!=1))"))||((F("(p527==1)"))&&("((p1082!=1)||(p861!=1))")))))
Formula 0 simplified : G(F!"((p1082!=1)||(p861!=1))" & (!"((p1082!=1)||(p861!=1))" | G!"(p527==1)"))
Detected timeout of ITS tools.
[2023-03-18 18:25:11] [INFO ] Flatten gal took : 14 ms
[2023-03-18 18:25:11] [INFO ] Applying decomposition
[2023-03-18 18:25:11] [INFO ] Flatten gal took : 13 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/graph12883116842517206222.txt' '-o' '/tmp/graph12883116842517206222.bin' '-w' '/tmp/graph12883116842517206222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12883116842517206222.bin' '-l' '-1' '-v' '-w' '/tmp/graph12883116842517206222.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:25:11] [INFO ] Decomposing Gal with order
[2023-03-18 18:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:25:11] [INFO ] Removed a total of 631 redundant transitions.
[2023-03-18 18:25:11] [INFO ] Flatten gal took : 34 ms
[2023-03-18 18:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 640 labels/synchronizations in 6 ms.
[2023-03-18 18:25:11] [INFO ] Time to serialize gal into /tmp/LTL11156790446178595198.gal : 3 ms
[2023-03-18 18:25:11] [INFO ] Time to serialize properties into /tmp/LTL3166000135022023775.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/LTL11156790446178595198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3166000135022023775.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("((i11.u109.p1082!=1)||(i8.i1.u86.p861!=1))"))||((F("(i5.u52.p527==1)"))&&("((i11.u109.p1082!=1)||(i8.i1.u86.p861!=1))")))))
Formula 0 simplified : G(F!"((i11.u109.p1082!=1)||(i8.i1.u86.p861!=1))" & (!"((i11.u109.p1082!=1)||(i8.i1.u86.p861!=1))" | G!"(i5.u52.p527==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1833042741730950405
[2023-03-18 18:25:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1833042741730950405
Running compilation step : cd /tmp/ltsmin1833042741730950405;'/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 913 ms.
Running link step : cd /tmp/ltsmin1833042741730950405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1833042741730950405;'/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))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-13 finished in 101233 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(X(!p0))) U (p1&&(p2||X((G(p1) U (p2&&G(p1))))))))'
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 50 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-18 18:25:41] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-18 18:25:41] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-18 18:25:41] [INFO ] Invariant cache hit.
[2023-03-18 18:25:42] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2023-03-18 18:25:42] [INFO ] Invariant cache hit.
[2023-03-18 18:25:42] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1593 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 628 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p1 p2), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 5}, { cond=(AND p1 p0), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 5}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 5}, { cond=(AND p1 p2), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p1:(EQ s564 1), p2:(EQ s962 1), p0:(AND (EQ s687 1) (EQ s698 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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]]
Product exploration explored 100000 steps with 19959 reset in 426 ms.
Product exploration explored 100000 steps with 19999 reset in 401 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 957 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 621 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 18:25:46] [INFO ] Invariant cache hit.
[2023-03-18 18:25:46] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2023-03-18 18:25:47] [INFO ] After 602ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-18 18:25:47] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 0 ms to minimize.
[2023-03-18 18:25:47] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 0 ms to minimize.
[2023-03-18 18:25:48] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 1 ms to minimize.
[2023-03-18 18:25:48] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 0 ms to minimize.
[2023-03-18 18:25:48] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-18 18:25:48] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 0 ms to minimize.
[2023-03-18 18:25:49] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2023-03-18 18:25:49] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 1 ms to minimize.
[2023-03-18 18:25:49] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 0 ms to minimize.
[2023-03-18 18:25:49] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 1 ms to minimize.
[2023-03-18 18:25:49] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2023-03-18 18:25:50] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 0 ms to minimize.
[2023-03-18 18:25:50] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-18 18:25:50] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-18 18:25:50] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 1 ms to minimize.
[2023-03-18 18:25:51] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-03-18 18:25:51] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 1 ms to minimize.
[2023-03-18 18:25:51] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 1 ms to minimize.
[2023-03-18 18:25:51] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 1 ms to minimize.
[2023-03-18 18:25:51] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 0 ms to minimize.
[2023-03-18 18:25:52] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 1 ms to minimize.
[2023-03-18 18:25:52] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 0 ms to minimize.
[2023-03-18 18:25:52] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 1 ms to minimize.
[2023-03-18 18:25:52] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 1 ms to minimize.
[2023-03-18 18:25:52] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 0 ms to minimize.
[2023-03-18 18:25:53] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5703 ms
[2023-03-18 18:25:53] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 0 ms to minimize.
[2023-03-18 18:25:53] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2023-03-18 18:25:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2023-03-18 18:25:53] [INFO ] After 6923ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 18:25:53] [INFO ] After 7201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 18:25:53] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-18 18:25:54] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 18:25:54] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
[2023-03-18 18:25:55] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 0 ms to minimize.
[2023-03-18 18:25:55] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 1 ms to minimize.
[2023-03-18 18:25:55] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 0 ms to minimize.
[2023-03-18 18:25:56] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2023-03-18 18:25:56] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 0 ms to minimize.
[2023-03-18 18:25:56] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 0 ms to minimize.
[2023-03-18 18:25:56] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 0 ms to minimize.
[2023-03-18 18:25:57] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 0 ms to minimize.
[2023-03-18 18:25:57] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 1 ms to minimize.
[2023-03-18 18:25:57] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 1 ms to minimize.
[2023-03-18 18:25:57] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 0 ms to minimize.
[2023-03-18 18:25:58] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 1 ms to minimize.
[2023-03-18 18:25:58] [INFO ] Deduced a trap composed of 89 places in 190 ms of which 0 ms to minimize.
[2023-03-18 18:25:58] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 1 ms to minimize.
[2023-03-18 18:25:58] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 0 ms to minimize.
[2023-03-18 18:25:59] [INFO ] Deduced a trap composed of 84 places in 182 ms of which 1 ms to minimize.
[2023-03-18 18:25:59] [INFO ] Deduced a trap composed of 91 places in 168 ms of which 1 ms to minimize.
[2023-03-18 18:25:59] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 0 ms to minimize.
[2023-03-18 18:25:59] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 1 ms to minimize.
[2023-03-18 18:25:59] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 1 ms to minimize.
[2023-03-18 18:26:00] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5418 ms
[2023-03-18 18:26:00] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 0 ms to minimize.
[2023-03-18 18:26:00] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 1 ms to minimize.
[2023-03-18 18:26:00] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 1 ms to minimize.
[2023-03-18 18:26:00] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 1 ms to minimize.
[2023-03-18 18:26:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 877 ms
[2023-03-18 18:26:01] [INFO ] After 7339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 230 ms.
[2023-03-18 18:26:01] [INFO ] After 7905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 158 ms.
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 992 transition count 1022
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 872 transition count 1022
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 240 place count 872 transition count 874
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 536 place count 724 transition count 874
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1132 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1194 place count 426 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1195 place count 425 transition count 575
Applied a total of 1195 rules in 71 ms. Remains 425 /992 variables (removed 567) and now considering 575/1142 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 425/992 places, 575/1142 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 575 rows 425 cols
[2023-03-18 18:26:02] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 18:26:02] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-18 18:26:02] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:26:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:26:02] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:26:02] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-18 18:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-18 18:26:03] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-18 18:26:03] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 20 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 425/425 places, 575/575 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 232404 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232404 steps, saw 93434 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 18:26:06] [INFO ] Invariant cache hit.
[2023-03-18 18:26:06] [INFO ] [Real]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-18 18:26:06] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:26:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 18:26:07] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:26:07] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-18 18:26:07] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-18 18:26:07] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-18 18:26:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2023-03-18 18:26:07] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-18 18:26:07] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-18 18:26:07] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-18 18:26:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2023-03-18 18:26:07] [INFO ] After 734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-18 18:26:07] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 12 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 425/425 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 11 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-18 18:26:07] [INFO ] Invariant cache hit.
[2023-03-18 18:26:08] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-18 18:26:08] [INFO ] Invariant cache hit.
[2023-03-18 18:26:08] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2023-03-18 18:26:08] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 18:26:08] [INFO ] Invariant cache hit.
[2023-03-18 18:26:08] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1068 ms. Remains : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 10 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-18 18:26:08] [INFO ] Invariant cache hit.
[2023-03-18 18:26:08] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-18 18:26:09] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:26:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 18:26:09] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:26:09] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-18 18:26:09] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-18 18:26:09] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-18 18:26:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2023-03-18 18:26:09] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-18 18:26:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-18 18:26:09] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-18 18:26:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2023-03-18 18:26:10] [INFO ] After 814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-18 18:26:10] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p2))), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 1013 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 645 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 462 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 1142 rows 992 cols
[2023-03-18 18:26:12] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-18 18:26:12] [INFO ] [Real]Absence check using 121 positive place invariants in 84 ms returned sat
[2023-03-18 18:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:26:14] [INFO ] [Real]Absence check using state equation in 1735 ms returned sat
[2023-03-18 18:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:26:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 79 ms returned sat
[2023-03-18 18:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:26:16] [INFO ] [Nat]Absence check using state equation in 1738 ms returned sat
[2023-03-18 18:26:17] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-18 18:26:29] [INFO ] Added : 640 causal constraints over 128 iterations in 12702 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-18 18:26:29] [INFO ] Invariant cache hit.
[2023-03-18 18:26:30] [INFO ] [Real]Absence check using 121 positive place invariants in 77 ms returned sat
[2023-03-18 18:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:26:32] [INFO ] [Real]Absence check using state equation in 1959 ms returned sat
[2023-03-18 18:26:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:26:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 79 ms returned sat
[2023-03-18 18:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:26:34] [INFO ] [Nat]Absence check using state equation in 1847 ms returned sat
[2023-03-18 18:26:34] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 103 ms.
[2023-03-18 18:26:47] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:26:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Applied a total of 0 rules in 23 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2023-03-18 18:26:47] [INFO ] Invariant cache hit.
[2023-03-18 18:26:48] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-18 18:26:48] [INFO ] Invariant cache hit.
[2023-03-18 18:26:48] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-18 18:26:48] [INFO ] Invariant cache hit.
[2023-03-18 18:26:49] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1484 ms. Remains : 992/992 places, 1142/1142 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 757 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 18:26:50] [INFO ] Invariant cache hit.
[2023-03-18 18:26:51] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-18 18:26:51] [INFO ] After 541ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-18 18:26:52] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 0 ms to minimize.
[2023-03-18 18:26:52] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 0 ms to minimize.
[2023-03-18 18:26:52] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 1 ms to minimize.
[2023-03-18 18:26:52] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 1 ms to minimize.
[2023-03-18 18:26:53] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 1 ms to minimize.
[2023-03-18 18:26:53] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 1 ms to minimize.
[2023-03-18 18:26:53] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 1 ms to minimize.
[2023-03-18 18:26:53] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 1 ms to minimize.
[2023-03-18 18:26:54] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2023-03-18 18:26:54] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 1 ms to minimize.
[2023-03-18 18:26:54] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2023-03-18 18:26:54] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2023-03-18 18:26:55] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-03-18 18:26:55] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2023-03-18 18:26:55] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 1 ms to minimize.
[2023-03-18 18:26:55] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2023-03-18 18:26:55] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 1 ms to minimize.
[2023-03-18 18:26:56] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 0 ms to minimize.
[2023-03-18 18:26:56] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 0 ms to minimize.
[2023-03-18 18:26:56] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 0 ms to minimize.
[2023-03-18 18:26:56] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 1 ms to minimize.
[2023-03-18 18:26:56] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 0 ms to minimize.
[2023-03-18 18:26:57] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 0 ms to minimize.
[2023-03-18 18:26:57] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 1 ms to minimize.
[2023-03-18 18:26:57] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 0 ms to minimize.
[2023-03-18 18:26:57] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5765 ms
[2023-03-18 18:26:57] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 0 ms to minimize.
[2023-03-18 18:26:57] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2023-03-18 18:26:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2023-03-18 18:26:58] [INFO ] After 6892ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 18:26:58] [INFO ] After 7204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 18:26:58] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-18 18:26:59] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 18:26:59] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 0 ms to minimize.
[2023-03-18 18:26:59] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 0 ms to minimize.
[2023-03-18 18:26:59] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 1 ms to minimize.
[2023-03-18 18:27:00] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 1 ms to minimize.
[2023-03-18 18:27:00] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2023-03-18 18:27:00] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 2 ms to minimize.
[2023-03-18 18:27:00] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 0 ms to minimize.
[2023-03-18 18:27:01] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2023-03-18 18:27:01] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 0 ms to minimize.
[2023-03-18 18:27:01] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 0 ms to minimize.
[2023-03-18 18:27:01] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 0 ms to minimize.
[2023-03-18 18:27:02] [INFO ] Deduced a trap composed of 62 places in 178 ms of which 0 ms to minimize.
[2023-03-18 18:27:02] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 1 ms to minimize.
[2023-03-18 18:27:02] [INFO ] Deduced a trap composed of 89 places in 206 ms of which 0 ms to minimize.
[2023-03-18 18:27:02] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 1 ms to minimize.
[2023-03-18 18:27:02] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 1 ms to minimize.
[2023-03-18 18:27:03] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 1 ms to minimize.
[2023-03-18 18:27:03] [INFO ] Deduced a trap composed of 91 places in 190 ms of which 1 ms to minimize.
[2023-03-18 18:27:03] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 1 ms to minimize.
[2023-03-18 18:27:03] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 1 ms to minimize.
[2023-03-18 18:27:04] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 1 ms to minimize.
[2023-03-18 18:27:04] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5085 ms
[2023-03-18 18:27:04] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 0 ms to minimize.
[2023-03-18 18:27:04] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 14 ms to minimize.
[2023-03-18 18:27:04] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 2 ms to minimize.
[2023-03-18 18:27:05] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 1 ms to minimize.
[2023-03-18 18:27:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 945 ms
[2023-03-18 18:27:05] [INFO ] After 7063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-18 18:27:05] [INFO ] After 7714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 992 transition count 1022
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 872 transition count 1022
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 240 place count 872 transition count 874
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 536 place count 724 transition count 874
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1132 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1194 place count 426 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1195 place count 425 transition count 575
Applied a total of 1195 rules in 86 ms. Remains 425 /992 variables (removed 567) and now considering 575/1142 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 425/992 places, 575/1142 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 575 rows 425 cols
[2023-03-18 18:27:06] [INFO ] Computed 121 place invariants in 18 ms
[2023-03-18 18:27:06] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 18:27:06] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:27:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-18 18:27:07] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:27:07] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-18 18:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-18 18:27:07] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-18 18:27:07] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 12 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 425/425 places, 575/575 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 247363 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247363 steps, saw 96596 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 18:27:10] [INFO ] Invariant cache hit.
[2023-03-18 18:27:10] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:27:11] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:27:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-18 18:27:11] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:27:11] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-18 18:27:11] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-18 18:27:11] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-18 18:27:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 171 ms
[2023-03-18 18:27:11] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-18 18:27:11] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-03-18 18:27:11] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-18 18:27:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2023-03-18 18:27:11] [INFO ] After 683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-18 18:27:11] [INFO ] After 881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 12 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 425/425 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 11 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-18 18:27:11] [INFO ] Invariant cache hit.
[2023-03-18 18:27:12] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-18 18:27:12] [INFO ] Invariant cache hit.
[2023-03-18 18:27:12] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-18 18:27:12] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-18 18:27:12] [INFO ] Invariant cache hit.
[2023-03-18 18:27:13] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1130 ms. Remains : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 11 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-18 18:27:13] [INFO ] Invariant cache hit.
[2023-03-18 18:27:13] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:27:13] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:27:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-18 18:27:13] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:27:13] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2023-03-18 18:27:13] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-18 18:27:13] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-18 18:27:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2023-03-18 18:27:14] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-18 18:27:14] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-18 18:27:14] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-18 18:27:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2023-03-18 18:27:14] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-18 18:27:14] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p2))), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 823 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 631 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 1142 rows 992 cols
[2023-03-18 18:27:16] [INFO ] Computed 121 place invariants in 12 ms
[2023-03-18 18:27:17] [INFO ] [Real]Absence check using 121 positive place invariants in 76 ms returned sat
[2023-03-18 18:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:27:18] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2023-03-18 18:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:27:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 81 ms returned sat
[2023-03-18 18:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:27:21] [INFO ] [Nat]Absence check using state equation in 1761 ms returned sat
[2023-03-18 18:27:21] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-18 18:27:34] [INFO ] Deduced a trap composed of 14 places in 469 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:27:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-18 18:27:34] [INFO ] Invariant cache hit.
[2023-03-18 18:27:34] [INFO ] [Real]Absence check using 121 positive place invariants in 79 ms returned sat
[2023-03-18 18:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:27:36] [INFO ] [Real]Absence check using state equation in 1821 ms returned sat
[2023-03-18 18:27:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:27:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 58 ms returned sat
[2023-03-18 18:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:27:38] [INFO ] [Nat]Absence check using state equation in 1785 ms returned sat
[2023-03-18 18:27:39] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 62 ms.
[2023-03-18 18:27:52] [INFO ] Deduced a trap composed of 14 places in 511 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:27:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 672 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 19971 reset in 402 ms.
Product exploration explored 100000 steps with 19995 reset in 472 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 640 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 992 transition count 1142
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 119 place count 992 transition count 1171
Deduced a syphon composed of 178 places in 2 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 178 place count 992 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 991 transition count 1170
Deduced a syphon composed of 177 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 991 transition count 1170
Performed 388 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 565 places in 3 ms
Iterating global reduction 1 with 388 rules applied. Total rules applied 568 place count 991 transition count 1170
Renaming transitions due to excessive name length > 1024 char.
Discarding 209 places :
Symmetric choice reduction at 1 with 209 rule applications. Total rules 777 place count 782 transition count 961
Deduced a syphon composed of 356 places in 0 ms
Iterating global reduction 1 with 209 rules applied. Total rules applied 986 place count 782 transition count 961
Deduced a syphon composed of 356 places in 1 ms
Applied a total of 986 rules in 165 ms. Remains 782 /992 variables (removed 210) and now considering 961/1142 (removed 181) transitions.
[2023-03-18 18:27:54] [INFO ] Redundant transitions in 140 ms returned [960]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 782 cols
[2023-03-18 18:27:54] [INFO ] Computed 121 place invariants in 12 ms
[2023-03-18 18:27:55] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 782/992 places, 960/1142 transitions.
Deduced a syphon composed of 356 places in 1 ms
Applied a total of 0 rules in 24 ms. Remains 782 /782 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 836 ms. Remains : 782/992 places, 960/1142 transitions.
Built C files in :
/tmp/ltsmin1403213062599732755
[2023-03-18 18:27:55] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1403213062599732755
Running compilation step : cd /tmp/ltsmin1403213062599732755;'/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 2116 ms.
Running link step : cd /tmp/ltsmin1403213062599732755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1403213062599732755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15035723693314371639.hoa' '--buchi-type=spotba'
LTSmin run took 1410 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-030B-LTLFireability-14 finished in 137652 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(F(p1)))))'
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 998 transition count 1028
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 878 transition count 1028
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 878 transition count 879
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 729 transition count 879
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 544 place count 723 transition count 873
Iterating global reduction 2 with 6 rules applied. Total rules applied 550 place count 723 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 550 place count 723 transition count 872
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1144 place count 426 transition count 576
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 1146 place count 424 transition count 574
Applied a total of 1146 rules in 72 ms. Remains 424 /999 variables (removed 575) and now considering 574/1149 (removed 575) transitions.
// Phase 1: matrix 574 rows 424 cols
[2023-03-18 18:27:59] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 18:27:59] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-18 18:27:59] [INFO ] Invariant cache hit.
[2023-03-18 18:27:59] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-18 18:27:59] [INFO ] Redundant transitions in 78 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2023-03-18 18:27:59] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:27:59] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/999 places, 573/1149 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 969 ms. Remains : 424/999 places, 573/1149 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s49 1), p1:(OR (NEQ s301 1) (NEQ s303 1) (NEQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 264 reset in 374 ms.
Product exploration explored 100000 steps with 265 reset in 430 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/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :1
Finished Best-First random walk after 1170 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=234 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 393 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 17 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-18 18:28:02] [INFO ] Invariant cache hit.
[2023-03-18 18:28:02] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-18 18:28:02] [INFO ] Invariant cache hit.
[2023-03-18 18:28:02] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-18 18:28:02] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-18 18:28:02] [INFO ] Invariant cache hit.
[2023-03-18 18:28:03] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1089 ms. Remains : 424/424 places, 573/573 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/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :1
Finished Best-First random walk after 7805 steps, including 2 resets, run visited all 1 properties in 26 ms. (steps per millisecond=300 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 257 reset in 537 ms.
Product exploration explored 100000 steps with 258 reset in 530 ms.
Built C files in :
/tmp/ltsmin7107474733978745233
[2023-03-18 18:28:05] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2023-03-18 18:28:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:28:05] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2023-03-18 18:28:05] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:28:05] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2023-03-18 18:28:05] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:28:05] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7107474733978745233
Running compilation step : cd /tmp/ltsmin7107474733978745233;'/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 1502 ms.
Running link step : cd /tmp/ltsmin7107474733978745233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7107474733978745233;'/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/stateBased12177666609800485525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 20 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-18 18:28:20] [INFO ] Invariant cache hit.
[2023-03-18 18:28:20] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-18 18:28:20] [INFO ] Invariant cache hit.
[2023-03-18 18:28:20] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-18 18:28:20] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-18 18:28:20] [INFO ] Invariant cache hit.
[2023-03-18 18:28:21] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 927 ms. Remains : 424/424 places, 573/573 transitions.
Built C files in :
/tmp/ltsmin4187592404573912790
[2023-03-18 18:28:21] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2023-03-18 18:28:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:28:21] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2023-03-18 18:28:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:28:21] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2023-03-18 18:28:21] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:28:21] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4187592404573912790
Running compilation step : cd /tmp/ltsmin4187592404573912790;'/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 1428 ms.
Running link step : cd /tmp/ltsmin4187592404573912790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin4187592404573912790;'/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/stateBased16423088618511327320.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:28:36] [INFO ] Flatten gal took : 18 ms
[2023-03-18 18:28:36] [INFO ] Flatten gal took : 15 ms
[2023-03-18 18:28:36] [INFO ] Time to serialize gal into /tmp/LTL8549859649096799119.gal : 3 ms
[2023-03-18 18:28:36] [INFO ] Time to serialize properties into /tmp/LTL11188830386565792002.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/LTL8549859649096799119.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14715621582469940107.hoa' '-atoms' '/tmp/LTL11188830386565792002.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/LTL11188830386565792002.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14715621582469940107.hoa
Detected timeout of ITS tools.
[2023-03-18 18:28:51] [INFO ] Flatten gal took : 21 ms
[2023-03-18 18:28:51] [INFO ] Flatten gal took : 20 ms
[2023-03-18 18:28:51] [INFO ] Time to serialize gal into /tmp/LTL9836827112446220527.gal : 5 ms
[2023-03-18 18:28:51] [INFO ] Time to serialize properties into /tmp/LTL3341210962976746048.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/LTL9836827112446220527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3341210962976746048.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("(p164==1)"))||(G(F("(((p862!=1)||(p868!=1))||(p877!=1))"))))))
Formula 0 simplified : G(F!"(p164==1)" & FG!"(((p862!=1)||(p868!=1))||(p877!=1))")
Detected timeout of ITS tools.
[2023-03-18 18:29:06] [INFO ] Flatten gal took : 15 ms
[2023-03-18 18:29:06] [INFO ] Applying decomposition
[2023-03-18 18:29:06] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2564822683549377760.txt' '-o' '/tmp/graph2564822683549377760.bin' '-w' '/tmp/graph2564822683549377760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2564822683549377760.bin' '-l' '-1' '-v' '-w' '/tmp/graph2564822683549377760.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:29:06] [INFO ] Decomposing Gal with order
[2023-03-18 18:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:29:06] [INFO ] Removed a total of 631 redundant transitions.
[2023-03-18 18:29:06] [INFO ] Flatten gal took : 60 ms
[2023-03-18 18:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 646 labels/synchronizations in 7 ms.
[2023-03-18 18:29:06] [INFO ] Time to serialize gal into /tmp/LTL3985078485758706856.gal : 4 ms
[2023-03-18 18:29:06] [INFO ] Time to serialize properties into /tmp/LTL7920366199288244821.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/LTL3985078485758706856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7920366199288244821.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(i1.i1.u14.p164==1)"))||(G(F("(((i9.i0.u85.p862!=1)||(i9.i0.u86.p868!=1))||(i9.i0.u87.p877!=1))"))))))
Formula 0 simplified : G(F!"(i1.i1.u14.p164==1)" & FG!"(((i9.i0.u85.p862!=1)||(i9.i0.u86.p868!=1))||(i9.i0.u87.p877!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7218360417684626427
[2023-03-18 18:29:21] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7218360417684626427
Running compilation step : cd /tmp/ltsmin7218360417684626427;'/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 1077 ms.
Running link step : cd /tmp/ltsmin7218360417684626427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin7218360417684626427;'/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-030B-LTLFireability-15 finished in 97889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U G(p2))))'
Found a Lengthening insensitive property : ShieldRVs-PT-030B-LTLFireability-04
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 999 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 998 transition count 1029
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 879 transition count 1029
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 238 place count 879 transition count 880
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 536 place count 730 transition count 880
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 542 place count 724 transition count 874
Iterating global reduction 2 with 6 rules applied. Total rules applied 548 place count 724 transition count 874
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 548 place count 724 transition count 873
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 550 place count 723 transition count 873
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 1 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1140 place count 428 transition count 578
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 1142 place count 426 transition count 576
Applied a total of 1142 rules in 104 ms. Remains 426 /999 variables (removed 573) and now considering 576/1149 (removed 573) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-18 18:29:37] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:29:37] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-18 18:29:37] [INFO ] Invariant cache hit.
[2023-03-18 18:29:38] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-18 18:29:38] [INFO ] Invariant cache hit.
[2023-03-18 18:29:38] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 426/999 places, 576/1149 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1099 ms. Remains : 426/999 places, 576/1149 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s92 1), p0:(AND (EQ s20 1) (EQ s22 1) (EQ s26 1)), p1:(NEQ s160 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 244 reset in 401 ms.
Product exploration explored 100000 steps with 244 reset in 451 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:29:39] [INFO ] Invariant cache hit.
[2023-03-18 18:29:39] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-18 18:29:40] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:29:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-18 18:29:40] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:29:40] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2023-03-18 18:29:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-18 18:29:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-18 18:29:40] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 18:29:40] [INFO ] After 411ms 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 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 576/576 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 575
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 574
Applied a total of 65 rules in 36 ms. Remains 424 /426 variables (removed 2) and now considering 574/576 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 424/426 places, 574/576 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468982 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468982 steps, saw 318456 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-18 18:29:43] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-18 18:29:43] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-18 18:29:43] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:29:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 18:29:44] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:29:44] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-18 18:29:44] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-18 18:29:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-03-18 18:29:44] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-18 18:29:44] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 18 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-18 18:29:44] [INFO ] Invariant cache hit.
[2023-03-18 18:29:44] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-18 18:29:44] [INFO ] Invariant cache hit.
[2023-03-18 18:29:45] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2023-03-18 18:29:45] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-18 18:29:45] [INFO ] Invariant cache hit.
[2023-03-18 18:29:45] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1111 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 18:29:45] [INFO ] Invariant cache hit.
[2023-03-18 18:29:45] [INFO ] [Real]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-18 18:29:45] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:29:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 18:29:46] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:29:46] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2023-03-18 18:29:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-18 18:29:46] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-18 18:29:46] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-18 18:29:46] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2023-03-18 18:29:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 285 ms
[2023-03-18 18:29:46] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 18:29:46] [INFO ] After 595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 544 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2023-03-18 18:29:47] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:29:47] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2023-03-18 18:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:29:47] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2023-03-18 18:29:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:29:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-18 18:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:29:48] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-18 18:29:48] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 31 ms.
[2023-03-18 18:29:53] [INFO ] Added : 475 causal constraints over 95 iterations in 5417 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 7 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-18 18:29:53] [INFO ] Invariant cache hit.
[2023-03-18 18:29:54] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-18 18:29:54] [INFO ] Invariant cache hit.
[2023-03-18 18:29:54] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-18 18:29:54] [INFO ] Invariant cache hit.
[2023-03-18 18:29:54] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1025 ms. Remains : 426/426 places, 576/576 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 362 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:29:55] [INFO ] Invariant cache hit.
[2023-03-18 18:29:55] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-18 18:29:55] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:29:55] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-18 18:29:55] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:29:56] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2023-03-18 18:29:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-18 18:29:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-03-18 18:29:56] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 18:29:56] [INFO ] After 420ms 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 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 576/576 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 575
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 574
Applied a total of 65 rules in 29 ms. Remains 424 /426 variables (removed 2) and now considering 574/576 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 424/426 places, 574/576 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 519132 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 519132 steps, saw 327497 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-18 18:29:59] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-18 18:29:59] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:29:59] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:29:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-18 18:29:59] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:29:59] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-18 18:29:59] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-18 18:30:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2023-03-18 18:30:00] [INFO ] After 325ms 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 18:30:00] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-18 18:30:00] [INFO ] Invariant cache hit.
[2023-03-18 18:30:00] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-18 18:30:00] [INFO ] Invariant cache hit.
[2023-03-18 18:30:00] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-18 18:30:00] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-18 18:30:00] [INFO ] Invariant cache hit.
[2023-03-18 18:30:01] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1115 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 18:30:01] [INFO ] Invariant cache hit.
[2023-03-18 18:30:01] [INFO ] [Real]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-18 18:30:01] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:30:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-18 18:30:01] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:30:01] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-18 18:30:01] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-18 18:30:01] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-18 18:30:01] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-18 18:30:02] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-18 18:30:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 348 ms
[2023-03-18 18:30:02] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-18 18:30:02] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 555 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2023-03-18 18:30:02] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:30:03] [INFO ] [Real]Absence check using 121 positive place invariants in 47 ms returned sat
[2023-03-18 18:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:30:03] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2023-03-18 18:30:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:30:04] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-18 18:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:30:04] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2023-03-18 18:30:04] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 40 ms.
[2023-03-18 18:30:10] [INFO ] Added : 475 causal constraints over 95 iterations in 5702 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 243 reset in 392 ms.
Product exploration explored 100000 steps with 244 reset in 420 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 11 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-18 18:30:11] [INFO ] Redundant transitions in 107 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2023-03-18 18:30:11] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:30:11] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/426 places, 575/576 transitions.
Applied a total of 0 rules in 8 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 426/426 places, 575/576 transitions.
Built C files in :
/tmp/ltsmin9915223559264044844
[2023-03-18 18:30:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9915223559264044844
Running compilation step : cd /tmp/ltsmin9915223559264044844;'/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 880 ms.
Running link step : cd /tmp/ltsmin9915223559264044844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9915223559264044844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6513660766581460724.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 11 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-18 18:30:27] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:30:27] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-18 18:30:27] [INFO ] Invariant cache hit.
[2023-03-18 18:30:27] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-18 18:30:27] [INFO ] Invariant cache hit.
[2023-03-18 18:30:27] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 774 ms. Remains : 426/426 places, 576/576 transitions.
Built C files in :
/tmp/ltsmin15240809306334976915
[2023-03-18 18:30:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15240809306334976915
Running compilation step : cd /tmp/ltsmin15240809306334976915;'/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 781 ms.
Running link step : cd /tmp/ltsmin15240809306334976915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15240809306334976915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3779994386813161529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:30:42] [INFO ] Flatten gal took : 13 ms
[2023-03-18 18:30:42] [INFO ] Flatten gal took : 13 ms
[2023-03-18 18:30:42] [INFO ] Time to serialize gal into /tmp/LTL6926654319926756956.gal : 3 ms
[2023-03-18 18:30:42] [INFO ] Time to serialize properties into /tmp/LTL9854942693802827149.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/LTL6926654319926756956.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12201984940537746210.hoa' '-atoms' '/tmp/LTL9854942693802827149.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/LTL9854942693802827149.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12201984940537746210.hoa
Detected timeout of ITS tools.
[2023-03-18 18:30:58] [INFO ] Flatten gal took : 28 ms
[2023-03-18 18:30:58] [INFO ] Flatten gal took : 24 ms
[2023-03-18 18:30:58] [INFO ] Time to serialize gal into /tmp/LTL13853455542294178454.gal : 8 ms
[2023-03-18 18:30:58] [INFO ] Time to serialize properties into /tmp/LTL4234339605784368807.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/LTL13853455542294178454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4234339605784368807.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(((p83==1)&&(p88==1))&&(p96==1))"))||(G("(p463!=1)"))))U(G("(p281==1)")))))
Formula 0 simplified : X(G(F!"(((p83==1)&&(p88==1))&&(p96==1))" & F!"(p463!=1)") R F!"(p281==1)")
Detected timeout of ITS tools.
[2023-03-18 18:31:13] [INFO ] Flatten gal took : 37 ms
[2023-03-18 18:31:13] [INFO ] Applying decomposition
[2023-03-18 18:31:13] [INFO ] Flatten gal took : 30 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/graph6168280320977540349.txt' '-o' '/tmp/graph6168280320977540349.bin' '-w' '/tmp/graph6168280320977540349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6168280320977540349.bin' '-l' '-1' '-v' '-w' '/tmp/graph6168280320977540349.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:31:13] [INFO ] Decomposing Gal with order
[2023-03-18 18:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:31:13] [INFO ] Removed a total of 633 redundant transitions.
[2023-03-18 18:31:13] [INFO ] Flatten gal took : 46 ms
[2023-03-18 18:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 650 labels/synchronizations in 10 ms.
[2023-03-18 18:31:13] [INFO ] Time to serialize gal into /tmp/LTL8606618005570979033.gal : 5 ms
[2023-03-18 18:31:13] [INFO ] Time to serialize properties into /tmp/LTL10887602955863819920.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/LTL8606618005570979033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10887602955863819920.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 : !((X((F((G("(((i0.i1.u5.p83==1)&&(i0.i1.u7.p88==1))&&(i0.i1.u8.p96==1))"))||(G("(i5.u46.p463!=1)"))))U(G("(i3.i0.u27.p281==1)")))))
Formula 0 simplified : X(G(F!"(((i0.i1.u5.p83==1)&&(i0.i1.u7.p88==1))&&(i0.i1.u8.p96==1))" & F!"(i5.u46.p463!=1)") R F!"(i3.i0.u27.p281==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13346459992837292236
[2023-03-18 18:31:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13346459992837292236
Running compilation step : cd /tmp/ltsmin13346459992837292236;'/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 1250 ms.
Running link step : cd /tmp/ltsmin13346459992837292236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13346459992837292236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 126645 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)))'
Found a Shortening insensitive property : ShieldRVs-PT-030B-LTLFireability-07
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 999 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 998 transition count 1028
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 878 transition count 1028
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 240 place count 878 transition count 877
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 542 place count 727 transition count 877
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 549 place count 720 transition count 870
Iterating global reduction 2 with 7 rules applied. Total rules applied 556 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 720 transition count 869
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 558 place count 719 transition count 869
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1146 place count 425 transition count 575
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 1148 place count 423 transition count 573
Applied a total of 1148 rules in 67 ms. Remains 423 /999 variables (removed 576) and now considering 573/1149 (removed 576) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-18 18:31:43] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-18 18:31:43] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-18 18:31:43] [INFO ] Invariant cache hit.
[2023-03-18 18:31:44] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-18 18:31:44] [INFO ] Invariant cache hit.
[2023-03-18 18:31:44] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 423/999 places, 573/1149 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 769 ms. Remains : 423/999 places, 573/1149 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-07 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 s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 27270 reset in 383 ms.
Product exploration explored 100000 steps with 27182 reset in 427 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/423 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 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 : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 116 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-18 18:31:45] [INFO ] Invariant cache hit.
[2023-03-18 18:31:45] [INFO ] [Real]Absence check using 121 positive place invariants in 26 ms returned sat
[2023-03-18 18:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:31:46] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2023-03-18 18:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:31:46] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2023-03-18 18:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:31:46] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-18 18:31:46] [INFO ] Computed and/alt/rep : 505/2162/505 causal constraints (skipped 66 transitions) in 27 ms.
[2023-03-18 18:31:52] [INFO ] Added : 499 causal constraints over 100 iterations in 5755 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 11 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-18 18:31:52] [INFO ] Invariant cache hit.
[2023-03-18 18:31:52] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-18 18:31:52] [INFO ] Invariant cache hit.
[2023-03-18 18:31:53] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2023-03-18 18:31:53] [INFO ] Redundant transitions in 92 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2023-03-18 18:31:53] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-18 18:31:53] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/423 places, 572/573 transitions.
Applied a total of 0 rules in 8 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1034 ms. Remains : 423/423 places, 572/573 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/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 107 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 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 129 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)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
[2023-03-18 18:31:54] [INFO ] Invariant cache hit.
[2023-03-18 18:31:54] [INFO ] [Real]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-18 18:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:31:54] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-18 18:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:31:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-18 18:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:31:55] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-18 18:31:55] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 24 ms.
[2023-03-18 18:32:00] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2023-03-18 18:32:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-18 18:32:00] [INFO ] Added : 498 causal constraints over 100 iterations in 5053 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26928 reset in 498 ms.
Product exploration explored 100000 steps with 27015 reset in 531 ms.
Built C files in :
/tmp/ltsmin4850445594887212929
[2023-03-18 18:32:01] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2023-03-18 18:32:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:32:01] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2023-03-18 18:32:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:32:01] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2023-03-18 18:32:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:32:01] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4850445594887212929
Running compilation step : cd /tmp/ltsmin4850445594887212929;'/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 1293 ms.
Running link step : cd /tmp/ltsmin4850445594887212929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin4850445594887212929;'/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/stateBased15009765479509295323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-18 18:32:16] [INFO ] Invariant cache hit.
[2023-03-18 18:32:16] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-18 18:32:16] [INFO ] Invariant cache hit.
[2023-03-18 18:32:16] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-03-18 18:32:17] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-18 18:32:17] [INFO ] Invariant cache hit.
[2023-03-18 18:32:17] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 890 ms. Remains : 423/423 places, 572/572 transitions.
Built C files in :
/tmp/ltsmin7202027838682015694
[2023-03-18 18:32:17] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2023-03-18 18:32:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:32:17] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2023-03-18 18:32:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:32:17] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2023-03-18 18:32:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:32:17] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7202027838682015694
Running compilation step : cd /tmp/ltsmin7202027838682015694;'/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 1283 ms.
Running link step : cd /tmp/ltsmin7202027838682015694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7202027838682015694;'/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/stateBased5649178192080293744.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:32:32] [INFO ] Flatten gal took : 29 ms
[2023-03-18 18:32:32] [INFO ] Flatten gal took : 25 ms
[2023-03-18 18:32:32] [INFO ] Time to serialize gal into /tmp/LTL1885769380064633979.gal : 5 ms
[2023-03-18 18:32:32] [INFO ] Time to serialize properties into /tmp/LTL7370367130948779358.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/LTL1885769380064633979.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11789585078359331915.hoa' '-atoms' '/tmp/LTL7370367130948779358.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/LTL7370367130948779358.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11789585078359331915.hoa
Detected timeout of ITS tools.
[2023-03-18 18:32:47] [INFO ] Flatten gal took : 28 ms
[2023-03-18 18:32:47] [INFO ] Flatten gal took : 31 ms
[2023-03-18 18:32:47] [INFO ] Time to serialize gal into /tmp/LTL10616875916330105395.gal : 8 ms
[2023-03-18 18:32:47] [INFO ] Time to serialize properties into /tmp/LTL13546536555264628375.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/LTL10616875916330105395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13546536555264628375.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 : !((X(F("(p230==1)"))))
Formula 0 simplified : XG!"(p230==1)"
Detected timeout of ITS tools.
[2023-03-18 18:33:02] [INFO ] Flatten gal took : 32 ms
[2023-03-18 18:33:02] [INFO ] Applying decomposition
[2023-03-18 18:33:02] [INFO ] Flatten gal took : 26 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/graph14216832591325775284.txt' '-o' '/tmp/graph14216832591325775284.bin' '-w' '/tmp/graph14216832591325775284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14216832591325775284.bin' '-l' '-1' '-v' '-w' '/tmp/graph14216832591325775284.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:33:02] [INFO ] Decomposing Gal with order
[2023-03-18 18:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:33:02] [INFO ] Removed a total of 625 redundant transitions.
[2023-03-18 18:33:02] [INFO ] Flatten gal took : 47 ms
[2023-03-18 18:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 652 labels/synchronizations in 8 ms.
[2023-03-18 18:33:02] [INFO ] Time to serialize gal into /tmp/LTL16092066633775187303.gal : 4 ms
[2023-03-18 18:33:02] [INFO ] Time to serialize properties into /tmp/LTL8115016051091862491.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/LTL16092066633775187303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8115016051091862491.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 : !((X(F("(i2.u21.p230==1)"))))
Formula 0 simplified : XG!"(i2.u21.p230==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3369968391383297664
[2023-03-18 18:33:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3369968391383297664
Running compilation step : cd /tmp/ltsmin3369968391383297664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 824 ms.
Running link step : cd /tmp/ltsmin3369968391383297664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3369968391383297664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 109461 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)||(!p0&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2023-03-18 18:33:33] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17219285275261832203
[2023-03-18 18:33:33] [INFO ] Computing symmetric may disable matrix : 1149 transitions.
[2023-03-18 18:33:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:33:33] [INFO ] Applying decomposition
[2023-03-18 18:33:33] [INFO ] Computing symmetric may enable matrix : 1149 transitions.
[2023-03-18 18:33:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:33:33] [INFO ] Flatten gal took : 26 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/graph17895897730138417427.txt' '-o' '/tmp/graph17895897730138417427.bin' '-w' '/tmp/graph17895897730138417427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17895897730138417427.bin' '-l' '-1' '-v' '-w' '/tmp/graph17895897730138417427.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:33:33] [INFO ] Decomposing Gal with order
[2023-03-18 18:33:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:33:33] [INFO ] Computing Do-Not-Accords matrix : 1149 transitions.
[2023-03-18 18:33:33] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:33:33] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17219285275261832203
Running compilation step : cd /tmp/ltsmin17219285275261832203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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 18:33:33] [INFO ] Removed a total of 1071 redundant transitions.
[2023-03-18 18:33:33] [INFO ] Flatten gal took : 83 ms
[2023-03-18 18:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-18 18:33:33] [INFO ] Time to serialize gal into /tmp/LTLFireability10211625060751940401.gal : 7 ms
[2023-03-18 18:33:33] [INFO ] Time to serialize properties into /tmp/LTLFireability7714399902530443990.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/LTLFireability10211625060751940401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7714399902530443990.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 4 LTL properties
Checking formula 0 : !((X((F((G("(((i1.u29.p83==1)&&(i1.u30.p88==1))&&(i1.u32.p96==1))"))||(G("(i6.u145.p463!=1)"))))U(G("(i3.u90.p281==1)")))))
Formula 0 simplified : X(G(F!"(((i1.u29.p83==1)&&(i1.u30.p88==1))&&(i1.u32.p96==1))" & F!"(i6.u145.p463!=1)") R F!"(i3.u90.p281==1)")
Compilation finished in 3624 ms.
Running link step : cd /tmp/ltsmin17219285275261832203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 121 ms.
Running LTSmin : cd /tmp/ltsmin17219285275261832203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17219285275261832203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17219285275261832203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 18:58:34] [INFO ] Applying decomposition
[2023-03-18 18:58:34] [INFO ] Flatten gal took : 366 ms
[2023-03-18 18:58:35] [INFO ] Decomposing Gal with order
[2023-03-18 18:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:58:35] [INFO ] Removed a total of 627 redundant transitions.
[2023-03-18 18:58:35] [INFO ] Flatten gal took : 380 ms
[2023-03-18 18:58:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 360 ms.
[2023-03-18 18:58:37] [INFO ] Time to serialize gal into /tmp/LTLFireability2791102942177926839.gal : 57 ms
[2023-03-18 18:58:37] [INFO ] Time to serialize properties into /tmp/LTLFireability5890411058232854766.ltl : 11 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/LTLFireability2791102942177926839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5890411058232854766.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...276
Read 4 LTL properties
Checking formula 0 : !((X((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.i0.i0.i0.i0.i0.i1.i0.i0.u41.p83==1)&&(i0.i0.i0.i0....540
Formula 0 simplified : X(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.i0.i0.i0.i0.i0.i1.i0.i0.u41.p83==1)&&(i0.i0.i0.i0.i0....529
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17219285275261832203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17219285275261832203;'/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' '<>(([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>((LTLAPp5==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17219285275261832203;'/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' '<>(([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>((LTLAPp5==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17219285275261832203;'/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' '<>(([]((LTLAPp6==true))||[](<>((LTLAPp7==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10005388 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16160596 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-030B"
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-030B, 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-167905974800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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