Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 868K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652945222671

Running Version 202205111006
[2022-05-19 07:27:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 07:27:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:27:04] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2022-05-19 07:27:04] [INFO ] Transformed 2503 places.
[2022-05-19 07:27:04] [INFO ] Transformed 2403 transitions.
[2022-05-19 07:27:04] [INFO ] Found NUPN structural information;
[2022-05-19 07:27:04] [INFO ] Parsed PT model containing 2503 places and 2403 transitions in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 266 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:27:04] [INFO ] Computed 901 place invariants in 37 ms
[2022-05-19 07:27:06] [INFO ] Implicit Places using invariants in 1404 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:27:06] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 07:27:07] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 3153 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:27:07] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 07:27:09] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 23 out of 2503 places after structural reductions.
[2022-05-19 07:27:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 07:27:09] [INFO ] Flatten gal took : 355 ms
FORMULA ShieldIIPs-PT-100A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 07:27:09] [INFO ] Flatten gal took : 202 ms
[2022-05-19 07:27:10] [INFO ] Input system was already deterministic with 2403 transitions.
Support contains 21 out of 2503 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:27:11] [INFO ] Computed 901 place invariants in 14 ms
[2022-05-19 07:27:12] [INFO ] [Real]Absence check using 901 positive place invariants in 165 ms returned sat
[2022-05-19 07:27:14] [INFO ] After 2769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 07:27:14] [INFO ] [Nat]Absence check using 901 positive place invariants in 170 ms returned sat
[2022-05-19 07:27:32] [INFO ] After 17888ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:27:33] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 3 ms to minimize.
[2022-05-19 07:27:33] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-19 07:27:33] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2022-05-19 07:27:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 559 ms
[2022-05-19 07:27:34] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
[2022-05-19 07:27:35] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2022-05-19 07:27:35] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2022-05-19 07:27:35] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-19 07:27:35] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-19 07:27:36] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-05-19 07:27:36] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 1 ms to minimize.
[2022-05-19 07:27:36] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-19 07:27:36] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-19 07:27:37] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2022-05-19 07:27:37] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2022-05-19 07:27:37] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2022-05-19 07:27:37] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-19 07:27:38] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-19 07:27:38] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-05-19 07:27:38] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2022-05-19 07:27:38] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2022-05-19 07:27:38] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-05-19 07:27:39] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-19 07:27:41] [INFO ] Deduced a trap composed of 3 places in 1886 ms of which 3 ms to minimize.
[2022-05-19 07:27:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:27:41] [INFO ] After 26909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 1184 ms.
Support contains 9 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 586 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 86069 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 86069 steps, saw 84677 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:27:47] [INFO ] Computed 901 place invariants in 147 ms
[2022-05-19 07:27:47] [INFO ] [Real]Absence check using 900 positive place invariants in 166 ms returned sat
[2022-05-19 07:27:47] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:27:49] [INFO ] After 1908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:27:49] [INFO ] [Nat]Absence check using 900 positive place invariants in 162 ms returned sat
[2022-05-19 07:27:49] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-19 07:27:51] [INFO ] After 1327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:27:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:27:51] [INFO ] After 200ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 07:27:51] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2022-05-19 07:27:51] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2022-05-19 07:27:51] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-19 07:27:51] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-19 07:27:52] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2022-05-19 07:27:52] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-05-19 07:27:52] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2022-05-19 07:27:52] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-19 07:27:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-05-19 07:27:52] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-19 07:27:53] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 5 ms to minimize.
[2022-05-19 07:27:53] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2022-05-19 07:27:53] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-05-19 07:27:53] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2022-05-19 07:27:55] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2022-05-19 07:27:55] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-05-19 07:27:55] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2022-05-19 07:27:56] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-05-19 07:27:56] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2022-05-19 07:27:56] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-19 07:27:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2022-05-19 07:27:56] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-19 07:27:56] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-19 07:27:56] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:27:57] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-05-19 07:27:57] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2022-05-19 07:27:57] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6026 ms
[2022-05-19 07:27:57] [INFO ] After 6457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 191 ms.
[2022-05-19 07:27:57] [INFO ] After 8610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 621 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2501 transition count 2401
Applied a total of 1 rules in 182 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 116292 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116292 steps, saw 114540 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:28:02] [INFO ] Computed 901 place invariants in 37 ms
[2022-05-19 07:28:02] [INFO ] [Real]Absence check using 900 positive place invariants in 161 ms returned sat
[2022-05-19 07:28:02] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:28:04] [INFO ] After 1936ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:28:04] [INFO ] [Nat]Absence check using 900 positive place invariants in 158 ms returned sat
[2022-05-19 07:28:04] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:28:05] [INFO ] After 1275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:28:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:28:06] [INFO ] After 185ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 07:28:06] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2022-05-19 07:28:06] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2022-05-19 07:28:06] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-05-19 07:28:06] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2022-05-19 07:28:07] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2022-05-19 07:28:07] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2022-05-19 07:28:07] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-05-19 07:28:07] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-05-19 07:28:07] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2022-05-19 07:28:07] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-19 07:28:08] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:28:08] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:28:08] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2022-05-19 07:28:08] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2022-05-19 07:28:08] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-19 07:28:09] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
[2022-05-19 07:28:09] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2022-05-19 07:28:09] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2022-05-19 07:28:09] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2022-05-19 07:28:10] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2022-05-19 07:28:10] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2022-05-19 07:28:10] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2022-05-19 07:28:10] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2022-05-19 07:28:10] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2022-05-19 07:28:11] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2022-05-19 07:28:11] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2022-05-19 07:28:11] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2022-05-19 07:28:11] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-19 07:28:11] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-05-19 07:28:11] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2022-05-19 07:28:11] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5780 ms
[2022-05-19 07:28:16] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2022-05-19 07:28:16] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:28:16] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2022-05-19 07:28:17] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2022-05-19 07:28:17] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-05-19 07:28:17] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2022-05-19 07:28:19] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2022-05-19 07:28:19] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2022-05-19 07:28:19] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2022-05-19 07:28:20] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2022-05-19 07:28:20] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2022-05-19 07:28:20] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2022-05-19 07:28:20] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2022-05-19 07:28:20] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-05-19 07:28:20] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-05-19 07:28:21] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:28:22] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2022-05-19 07:28:22] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:28:22] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2022-05-19 07:28:26] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:28:26] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2022-05-19 07:28:26] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:28:26] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:28:27] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2022-05-19 07:28:27] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2022-05-19 07:28:27] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-05-19 07:28:27] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-05-19 07:28:27] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2022-05-19 07:28:28] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2022-05-19 07:28:28] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2022-05-19 07:28:28] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2022-05-19 07:28:30] [INFO ] Deduced a trap composed of 3 places in 1902 ms of which 4 ms to minimize.
[2022-05-19 07:28:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:28:30] [INFO ] After 26922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 505 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 82 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:28:31] [INFO ] Computed 901 place invariants in 28 ms
[2022-05-19 07:28:33] [INFO ] Implicit Places using invariants in 1449 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:28:33] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 07:28:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:28:38] [INFO ] Implicit Places using invariants and state equation in 5412 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6870 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 130068 steps, run timeout after 3003 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130068 steps, saw 128184 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:28:42] [INFO ] Computed 900 place invariants in 39 ms
[2022-05-19 07:28:42] [INFO ] [Real]Absence check using 899 positive place invariants in 164 ms returned sat
[2022-05-19 07:28:42] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:28:43] [INFO ] After 1912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:28:44] [INFO ] [Nat]Absence check using 899 positive place invariants in 160 ms returned sat
[2022-05-19 07:28:44] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-19 07:28:46] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:28:46] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2022-05-19 07:28:46] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2022-05-19 07:28:46] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2022-05-19 07:28:47] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2022-05-19 07:28:47] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2022-05-19 07:28:47] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:28:47] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2022-05-19 07:28:47] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2022-05-19 07:28:48] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2022-05-19 07:28:48] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2022-05-19 07:28:48] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2022-05-19 07:28:48] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2022-05-19 07:28:48] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2022-05-19 07:28:48] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2022-05-19 07:28:49] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-19 07:28:49] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3122 ms
[2022-05-19 07:28:52] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2022-05-19 07:28:53] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-05-19 07:28:53] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2022-05-19 07:28:53] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2022-05-19 07:28:53] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2022-05-19 07:28:54] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2022-05-19 07:28:54] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2022-05-19 07:28:54] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-05-19 07:28:54] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:28:55] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-05-19 07:28:56] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2022-05-19 07:28:56] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2022-05-19 07:28:56] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2022-05-19 07:28:59] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2022-05-19 07:29:04] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2022-05-19 07:29:04] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2022-05-19 07:29:08] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 16224 ms
[2022-05-19 07:29:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:29:08] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 196 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:29:09] [INFO ] Computed 900 place invariants in 33 ms
[2022-05-19 07:29:10] [INFO ] Implicit Places using invariants in 1375 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:29:10] [INFO ] Computed 900 place invariants in 22 ms
[2022-05-19 07:29:15] [INFO ] Implicit Places using invariants and state equation in 4577 ms returned []
Implicit Place search using SMT with State Equation took 5957 ms to find 0 implicit places.
[2022-05-19 07:29:15] [INFO ] Redundant transitions in 181 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:29:15] [INFO ] Computed 900 place invariants in 29 ms
[2022-05-19 07:29:16] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||G((X(p1) U !X(!X(p2))))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 62 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:29:17] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 07:29:18] [INFO ] Implicit Places using invariants in 1192 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:29:18] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:29:19] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:29:19] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:29:21] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s553 0) (EQ s1396 1)), p1:(EQ s1535 1), p2:(OR (EQ s210 0) (EQ s73 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33295 reset in 6413 ms.
Product exploration explored 100000 steps with 33387 reset in 6611 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1035 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:29:37] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:29:38] [INFO ] [Real]Absence check using 901 positive place invariants in 172 ms returned sat
[2022-05-19 07:29:40] [INFO ] After 3642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-19 07:29:41] [INFO ] [Nat]Absence check using 901 positive place invariants in 177 ms returned sat
[2022-05-19 07:30:05] [INFO ] After 23825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 07:30:05] [INFO ] After 23833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-19 07:30:05] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2847 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 701 place count 2501 transition count 2401
Applied a total of 701 rules in 255 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 83453 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{4=1, 8=1}
Probabilistic random walk after 83453 steps, saw 82087 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:30:13] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 07:30:14] [INFO ] [Real]Absence check using 900 positive place invariants in 177 ms returned sat
[2022-05-19 07:30:14] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:30:16] [INFO ] After 3106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:30:17] [INFO ] [Nat]Absence check using 900 positive place invariants in 175 ms returned sat
[2022-05-19 07:30:17] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:30:41] [INFO ] After 23963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 07:30:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:30:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:30:41] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1120 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 81132 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81132 steps, saw 79792 distinct states, run finished after 3004 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:30:47] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 07:30:47] [INFO ] [Real]Absence check using 900 positive place invariants in 155 ms returned sat
[2022-05-19 07:30:47] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-19 07:30:50] [INFO ] After 3096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:30:51] [INFO ] [Nat]Absence check using 900 positive place invariants in 174 ms returned sat
[2022-05-19 07:30:51] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:31:15] [INFO ] After 23954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:31:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:31:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:31:15] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:31:15] [INFO ] Computed 901 place invariants in 28 ms
[2022-05-19 07:31:17] [INFO ] Implicit Places using invariants in 1411 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:31:17] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 07:31:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:31:22] [INFO ] Implicit Places using invariants and state equation in 5857 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7273 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 1802 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:31:25] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:31:26] [INFO ] Implicit Places using invariants in 1137 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:31:26] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:31:27] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:31:27] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:31:29] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 926 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:31:31] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:31:32] [INFO ] [Real]Absence check using 901 positive place invariants in 161 ms returned sat
[2022-05-19 07:31:35] [INFO ] After 3504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-19 07:31:35] [INFO ] [Nat]Absence check using 901 positive place invariants in 151 ms returned sat
[2022-05-19 07:32:00] [INFO ] After 23901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 07:32:00] [INFO ] After 23911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 07:32:00] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2759 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 701 place count 2501 transition count 2401
Applied a total of 701 rules in 253 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 76717 steps, run timeout after 3003 ms. (steps per millisecond=25 ) properties seen :{4=1, 8=1}
Probabilistic random walk after 76717 steps, saw 75426 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :2
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:32:07] [INFO ] Computed 901 place invariants in 28 ms
[2022-05-19 07:32:08] [INFO ] [Real]Absence check using 900 positive place invariants in 158 ms returned sat
[2022-05-19 07:32:08] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:32:11] [INFO ] After 3220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:32:11] [INFO ] [Nat]Absence check using 900 positive place invariants in 156 ms returned sat
[2022-05-19 07:32:11] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:32:36] [INFO ] After 23985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:32:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:32:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:32:36] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 77712 steps, run timeout after 3003 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77712 steps, saw 76410 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:32:40] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 07:32:41] [INFO ] [Real]Absence check using 900 positive place invariants in 167 ms returned sat
[2022-05-19 07:32:41] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:32:43] [INFO ] After 3207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:32:44] [INFO ] [Nat]Absence check using 900 positive place invariants in 161 ms returned sat
[2022-05-19 07:32:44] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:33:08] [INFO ] After 24041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:33:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:33:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:33:08] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 429 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:33:09] [INFO ] Computed 901 place invariants in 27 ms
[2022-05-19 07:33:11] [INFO ] Implicit Places using invariants in 2133 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2138 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 1112 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33452 reset in 6412 ms.
Product exploration explored 100000 steps with 33378 reset in 6601 ms.
Built C files in :
/tmp/ltsmin11028758008459079040
[2022-05-19 07:33:26] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11028758008459079040
Running compilation step : cd /tmp/ltsmin11028758008459079040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11028758008459079040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11028758008459079040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 59 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:33:29] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:33:30] [INFO ] Implicit Places using invariants in 1180 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:33:30] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:33:34] [INFO ] Implicit Places using invariants and state equation in 3749 ms returned []
Implicit Place search using SMT with State Equation took 4946 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:33:34] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:33:35] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin10920397995748766622
[2022-05-19 07:33:35] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10920397995748766622
Running compilation step : cd /tmp/ltsmin10920397995748766622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10920397995748766622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10920397995748766622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:33:39] [INFO ] Flatten gal took : 175 ms
[2022-05-19 07:33:39] [INFO ] Flatten gal took : 157 ms
[2022-05-19 07:33:39] [INFO ] Time to serialize gal into /tmp/LTL2498837128463506520.gal : 38 ms
[2022-05-19 07:33:39] [INFO ] Time to serialize properties into /tmp/LTL13706524674275391436.ltl : 373 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2498837128463506520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13706524674275391436.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2498837...267
Read 1 LTL properties
Checking formula 0 : !((F(G((X("((p553==0)&&(p1396==1))"))||(G((X("(p1535==1)"))U(!(X(!(X("((p210==0)||(p73==1))")))))))))))
Formula 0 simplified : !FG(X"((p553==0)&&(p1396==1))" | G(X"(p1535==1)" U !X!X"((p210==0)||(p73==1))"))
Detected timeout of ITS tools.
[2022-05-19 07:33:54] [INFO ] Flatten gal took : 147 ms
[2022-05-19 07:33:54] [INFO ] Applying decomposition
[2022-05-19 07:33:55] [INFO ] Flatten gal took : 146 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2907847420039940568.txt' '-o' '/tmp/graph2907847420039940568.bin' '-w' '/tmp/graph2907847420039940568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2907847420039940568.bin' '-l' '-1' '-v' '-w' '/tmp/graph2907847420039940568.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:33:55] [INFO ] Decomposing Gal with order
[2022-05-19 07:33:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:33:55] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 07:33:56] [INFO ] Flatten gal took : 267 ms
[2022-05-19 07:33:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1544 labels/synchronizations in 443 ms.
[2022-05-19 07:33:56] [INFO ] Time to serialize gal into /tmp/LTL17278311290767364098.gal : 36 ms
[2022-05-19 07:33:56] [INFO ] Time to serialize properties into /tmp/LTL3220769110495412073.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17278311290767364098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3220769110495412073.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1727831...246
Read 1 LTL properties
Checking formula 0 : !((F(G((X("((i9.i0.i0.u199.p553==0)&&(i23.i1.i0.u503.p1396==1))"))||(G((X("(i25.i1.i2.u553.p1535==1)"))U(!(X(!(X("((i3.i1.i2.u76.p210=...194
Formula 0 simplified : !FG(X"((i9.i0.i0.u199.p553==0)&&(i23.i1.i0.u503.p1396==1))" | G(X"(i25.i1.i2.u553.p1535==1)" U !X!X"((i3.i1.i2.u76.p210==0)||(i1.i0....173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6589420150597375013
[2022-05-19 07:34:11] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6589420150597375013
Running compilation step : cd /tmp/ltsmin6589420150597375013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6589420150597375013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6589420150597375013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-00 finished in 297829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 56 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:34:14] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:34:16] [INFO ] Implicit Places using invariants in 1344 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:34:16] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:34:19] [INFO ] Implicit Places using invariants and state equation in 3752 ms returned []
Implicit Place search using SMT with State Equation took 5099 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:34:19] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:34:21] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s225 0) (EQ s613 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8678 ms.
Product exploration explored 100000 steps with 50000 reset in 8886 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-03 finished in 24087 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(!(p0 U p1)))))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:34:38] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:34:40] [INFO ] Implicit Places using invariants in 1123 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:34:40] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:34:43] [INFO ] Implicit Places using invariants and state equation in 3639 ms returned []
Implicit Place search using SMT with State Equation took 4767 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:34:43] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:34:44] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 85 ms :[p1, p1, p1]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s402 1), p1:(EQ s1969 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24 reset in 1482 ms.
Product exploration explored 100000 steps with 24 reset in 1815 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[false, p1, p1]
Finished random walk after 1008 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[false, p1, p1]
Stuttering acceptance computed with spot in 92 ms :[false, p1, p1]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 207 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:34:49] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:34:50] [INFO ] Implicit Places using invariants in 1211 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:34:50] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:34:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:34:55] [INFO ] Implicit Places using invariants and state equation in 5216 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6431 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 94 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2503 places, 2401/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[false, p1]
Finished random walk after 956 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[false, p1]
Stuttering acceptance computed with spot in 66 ms :[false, p1]
Stuttering acceptance computed with spot in 48 ms :[false, p1]
Product exploration explored 100000 steps with 40 reset in 1473 ms.
Stuttering criterion allowed to conclude after 98531 steps with 45 reset in 1805 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-06 finished in 20871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 59 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:34:59] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:35:01] [INFO ] Implicit Places using invariants in 1545 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:01] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 07:35:03] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:03] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:35:04] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s1934 0) (NEQ s1974 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-07 finished in 4693 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !p1))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 61 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:04] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:35:05] [INFO ] Implicit Places using invariants in 1120 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:05] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:35:07] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:07] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:35:08] [INFO ] Dead Transitions using invariants and state equation in 1673 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 673 ms :[true, p1, (OR (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1539 0) (EQ s1210 1)), p0:(OR (EQ s1227 0) (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], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 38 reset in 1480 ms.
Product exploration explored 100000 steps with 38 reset in 1827 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:13] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:35:13] [INFO ] [Real]Absence check using 901 positive place invariants in 159 ms returned sat
[2022-05-19 07:35:15] [INFO ] After 1790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:35:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 159 ms returned sat
[2022-05-19 07:35:23] [INFO ] After 8080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:35:28] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2022-05-19 07:35:36] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2022-05-19 07:35:37] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 0 ms to minimize.
[2022-05-19 07:35:37] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2022-05-19 07:35:38] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 1 ms to minimize.
[2022-05-19 07:35:38] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2022-05-19 07:35:39] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2022-05-19 07:35:39] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2022-05-19 07:35:40] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2022-05-19 07:35:40] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 11519 ms
[2022-05-19 07:35:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:35:40] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 284 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 0 with 698 rules applied. Total rules applied 702 place count 2501 transition count 2401
Applied a total of 702 rules in 224 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25246 steps, run visited all 1 properties in 472 ms. (steps per millisecond=53 )
Probabilistic random walk after 25246 steps, saw 24484 distinct states, run finished after 475 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:41] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 07:35:45] [INFO ] [Real]Absence check using 901 positive place invariants in 1147 ms returned sat
[2022-05-19 07:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:56] [INFO ] [Real]Absence check using state equation in 11349 ms returned unknown
Could not prove EG p1
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 60 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:56] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 07:35:58] [INFO ] Implicit Places using invariants in 1126 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:35:58] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:36:01] [INFO ] Implicit Places using invariants and state equation in 3844 ms returned []
Implicit Place search using SMT with State Equation took 4970 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:36:01] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:36:03] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:36:03] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:36:04] [INFO ] [Real]Absence check using 901 positive place invariants in 162 ms returned sat
[2022-05-19 07:36:05] [INFO ] After 1739ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:36:06] [INFO ] [Nat]Absence check using 901 positive place invariants in 159 ms returned sat
[2022-05-19 07:36:14] [INFO ] After 8059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:36:19] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-19 07:36:26] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2022-05-19 07:36:27] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2022-05-19 07:36:27] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2022-05-19 07:36:28] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2022-05-19 07:36:28] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-19 07:36:29] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2022-05-19 07:36:29] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2022-05-19 07:36:30] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2022-05-19 07:36:30] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-19 07:36:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:36:30] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 287 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 0 with 698 rules applied. Total rules applied 702 place count 2501 transition count 2401
Applied a total of 702 rules in 231 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25246 steps, run visited all 1 properties in 472 ms. (steps per millisecond=53 )
Probabilistic random walk after 25246 steps, saw 24484 distinct states, run finished after 474 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:36:32] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:36:36] [INFO ] [Real]Absence check using 901 positive place invariants in 1174 ms returned sat
[2022-05-19 07:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:36:47] [INFO ] [Real]Absence check using state equation in 11247 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Product exploration explored 100000 steps with 38 reset in 1467 ms.
Product exploration explored 100000 steps with 38 reset in 1819 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 387 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2022-05-19 07:36:52] [INFO ] Redundant transitions in 890 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2022-05-19 07:36:52] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:36:53] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 0 rules in 84 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/2503 places, 2402/2403 transitions.
Product exploration explored 100000 steps with 38 reset in 1523 ms.
Product exploration explored 100000 steps with 38 reset in 1875 ms.
Built C files in :
/tmp/ltsmin1953492908960303475
[2022-05-19 07:36:56] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1953492908960303475
Running compilation step : cd /tmp/ltsmin1953492908960303475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1953492908960303475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1953492908960303475;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 72 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:36:59] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:37:01] [INFO ] Implicit Places using invariants in 1169 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:37:01] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:37:02] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2825 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:37:02] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:37:04] [INFO ] Dead Transitions using invariants and state equation in 1243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin6946094355129685195
[2022-05-19 07:37:04] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6946094355129685195
Running compilation step : cd /tmp/ltsmin6946094355129685195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6946094355129685195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6946094355129685195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:37:07] [INFO ] Flatten gal took : 142 ms
[2022-05-19 07:37:07] [INFO ] Flatten gal took : 142 ms
[2022-05-19 07:37:07] [INFO ] Time to serialize gal into /tmp/LTL13547458646913897792.gal : 15 ms
[2022-05-19 07:37:07] [INFO ] Time to serialize properties into /tmp/LTL10129835107860907980.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13547458646913897792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10129835107860907980.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1354745...268
Read 1 LTL properties
Checking formula 0 : !(((X("((p1227==0)||(p73==1))"))U(!("((p1539==0)||(p1210==1))"))))
Formula 0 simplified : !(X"((p1227==0)||(p73==1))" U !"((p1539==0)||(p1210==1))")
Detected timeout of ITS tools.
[2022-05-19 07:37:22] [INFO ] Flatten gal took : 135 ms
[2022-05-19 07:37:22] [INFO ] Applying decomposition
[2022-05-19 07:37:22] [INFO ] Flatten gal took : 155 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9994133767006460718.txt' '-o' '/tmp/graph9994133767006460718.bin' '-w' '/tmp/graph9994133767006460718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9994133767006460718.bin' '-l' '-1' '-v' '-w' '/tmp/graph9994133767006460718.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:37:23] [INFO ] Decomposing Gal with order
[2022-05-19 07:37:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:37:23] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 07:37:23] [INFO ] Flatten gal took : 145 ms
[2022-05-19 07:37:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1528 labels/synchronizations in 171 ms.
[2022-05-19 07:37:23] [INFO ] Time to serialize gal into /tmp/LTL13330048930305722679.gal : 21 ms
[2022-05-19 07:37:23] [INFO ] Time to serialize properties into /tmp/LTL2490632227610909787.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13330048930305722679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2490632227610909787.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1333004...246
Read 1 LTL properties
Checking formula 0 : !(((X("((i20.i0.i2.u441.p1227==0)||(i1.i0.i1.u26.p73==1))"))U(!("((i24.i2.i1.u555.p1539==0)||(i20.i0.i0.u436.p1210==1))"))))
Formula 0 simplified : !(X"((i20.i0.i2.u441.p1227==0)||(i1.i0.i1.u26.p73==1))" U !"((i24.i2.i1.u555.p1539==0)||(i20.i0.i0.u436.p1210==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12917364886922796012
[2022-05-19 07:37:38] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12917364886922796012
Running compilation step : cd /tmp/ltsmin12917364886922796012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12917364886922796012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12917364886922796012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-09 finished in 157352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 69 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:37:41] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:37:43] [INFO ] Implicit Places using invariants in 1208 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:37:43] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:37:44] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:37:44] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:37:45] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 1193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1685 0) (EQ s1570 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 60 reset in 1620 ms.
Product exploration explored 100000 steps with 61 reset in 1781 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 694 ms :[(NOT p0), false]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 164 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:37:51] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:37:52] [INFO ] Implicit Places using invariants in 1144 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:37:52] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:37:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:37:54] [INFO ] Implicit Places using invariants and state equation in 1840 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
[2022-05-19 07:37:55] [INFO ] Redundant transitions in 245 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:37:55] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:37:56] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2503 places, 2400/2403 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 619 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), false]
Product exploration explored 100000 steps with 113 reset in 1483 ms.
Product exploration explored 100000 steps with 127 reset in 1796 ms.
Built C files in :
/tmp/ltsmin4742506535885537450
[2022-05-19 07:38:00] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:38:00] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4742506535885537450
Running compilation step : cd /tmp/ltsmin4742506535885537450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4742506535885537450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4742506535885537450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:38:03] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 07:38:05] [INFO ] Implicit Places using invariants in 1219 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:38:05] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:38:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:38:06] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 3016 ms to find 0 implicit places.
[2022-05-19 07:38:07] [INFO ] Redundant transitions in 233 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:38:07] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:38:08] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin2649178006317923161
[2022-05-19 07:38:08] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:38:08] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2649178006317923161
Running compilation step : cd /tmp/ltsmin2649178006317923161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2649178006317923161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2649178006317923161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:38:11] [INFO ] Flatten gal took : 133 ms
[2022-05-19 07:38:11] [INFO ] Flatten gal took : 133 ms
[2022-05-19 07:38:11] [INFO ] Time to serialize gal into /tmp/LTL11747556795992908408.gal : 9 ms
[2022-05-19 07:38:11] [INFO ] Time to serialize properties into /tmp/LTL655071863060963339.ltl : 127 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11747556795992908408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL655071863060963339.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1174755...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((p1685==0)||(p1570==1))"))))
Formula 0 simplified : !XF"((p1685==0)||(p1570==1))"
Detected timeout of ITS tools.
[2022-05-19 07:38:27] [INFO ] Flatten gal took : 133 ms
[2022-05-19 07:38:27] [INFO ] Applying decomposition
[2022-05-19 07:38:27] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4403511700614468437.txt' '-o' '/tmp/graph4403511700614468437.bin' '-w' '/tmp/graph4403511700614468437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4403511700614468437.bin' '-l' '-1' '-v' '-w' '/tmp/graph4403511700614468437.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:38:27] [INFO ] Decomposing Gal with order
[2022-05-19 07:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:38:27] [INFO ] Removed a total of 1595 redundant transitions.
[2022-05-19 07:38:27] [INFO ] Flatten gal took : 146 ms
[2022-05-19 07:38:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1536 labels/synchronizations in 168 ms.
[2022-05-19 07:38:28] [INFO ] Time to serialize gal into /tmp/LTL7800862362266185437.gal : 19 ms
[2022-05-19 07:38:28] [INFO ] Time to serialize properties into /tmp/LTL14799465641265168262.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7800862362266185437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14799465641265168262.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7800862...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i30.i1.i2.u607.p1685==0)||(i28.i0.i0.u566.p1570==1))"))))
Formula 0 simplified : !XF"((i30.i1.i2.u607.p1685==0)||(i28.i0.i0.u566.p1570==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17183947405812614795
[2022-05-19 07:38:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17183947405812614795
Running compilation step : cd /tmp/ltsmin17183947405812614795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17183947405812614795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17183947405812614795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-11 finished in 64393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(!(F(!p0) U X(p1))))&&p2)))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 156 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:38:46] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:38:47] [INFO ] Implicit Places using invariants in 1132 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:38:47] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:38:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:38:49] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
[2022-05-19 07:38:49] [INFO ] Redundant transitions in 262 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:38:49] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:38:50] [INFO ] Dead Transitions using invariants and state equation in 1203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 71 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s138 0) (EQ s1637 1)), p0:(OR (EQ s2194 0) (EQ s772 1)), p1:(EQ s2479 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 30793 reset in 5912 ms.
Product exploration explored 100000 steps with 30789 reset in 6061 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND p2 (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X p2)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1021 ms. Reduced automaton from 6 states, 19 edges and 3 AP to 6 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:39:04] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:39:04] [INFO ] [Real]Absence check using 901 positive place invariants in 168 ms returned sat
[2022-05-19 07:39:06] [INFO ] After 1780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:39:06] [INFO ] [Nat]Absence check using 901 positive place invariants in 161 ms returned sat
[2022-05-19 07:39:07] [INFO ] After 1190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:39:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:39:07] [INFO ] After 90ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:39:08] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-05-19 07:39:08] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-19 07:39:08] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2022-05-19 07:39:08] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-05-19 07:39:08] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-19 07:39:08] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2022-05-19 07:39:08] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-19 07:39:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1059 ms
[2022-05-19 07:39:09] [INFO ] After 1219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-19 07:39:09] [INFO ] After 3063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 204 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 0 with 698 rules applied. Total rules applied 698 place count 2501 transition count 2400
Applied a total of 698 rules in 137 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167994 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167994 steps, saw 165579 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:39:12] [INFO ] Computed 901 place invariants in 30 ms
[2022-05-19 07:39:13] [INFO ] [Real]Absence check using 900 positive place invariants in 160 ms returned sat
[2022-05-19 07:39:13] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:39:14] [INFO ] After 1728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:39:15] [INFO ] [Nat]Absence check using 900 positive place invariants in 172 ms returned sat
[2022-05-19 07:39:15] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:39:16] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:39:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:39:16] [INFO ] After 94ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:39:16] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2022-05-19 07:39:17] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2022-05-19 07:39:17] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 0 ms to minimize.
[2022-05-19 07:39:17] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2022-05-19 07:39:17] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2022-05-19 07:39:18] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2022-05-19 07:39:18] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2022-05-19 07:39:18] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2022-05-19 07:39:18] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2022-05-19 07:39:18] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2022-05-19 07:39:19] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2022-05-19 07:39:19] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2022-05-19 07:39:19] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:39:19] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2022-05-19 07:39:19] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2022-05-19 07:39:20] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-19 07:39:20] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2022-05-19 07:39:20] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:39:20] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-05-19 07:39:20] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2022-05-19 07:39:21] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:39:21] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-19 07:39:21] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:39:21] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2022-05-19 07:39:21] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-05-19 07:39:22] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2022-05-19 07:39:22] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:39:22] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2022-05-19 07:39:22] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-19 07:39:22] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-05-19 07:39:22] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2022-05-19 07:39:23] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2022-05-19 07:39:23] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2022-05-19 07:39:23] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2022-05-19 07:39:23] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-05-19 07:39:23] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-19 07:39:23] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-19 07:39:24] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-05-19 07:39:24] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-19 07:39:24] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7876 ms
[2022-05-19 07:39:24] [INFO ] After 8064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-19 07:39:24] [INFO ] After 9983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 198 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 68 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:39:24] [INFO ] Computed 901 place invariants in 29 ms
[2022-05-19 07:39:26] [INFO ] Implicit Places using invariants in 1429 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:39:26] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 07:39:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:39:31] [INFO ] Implicit Places using invariants and state equation in 5457 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6893 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 172444 steps, run timeout after 3002 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172444 steps, saw 169931 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:39:35] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 07:39:35] [INFO ] [Real]Absence check using 899 positive place invariants in 160 ms returned sat
[2022-05-19 07:39:35] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:39:36] [INFO ] After 1741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:39:37] [INFO ] [Nat]Absence check using 899 positive place invariants in 168 ms returned sat
[2022-05-19 07:39:37] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-19 07:39:38] [INFO ] After 1187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:39:38] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2022-05-19 07:39:39] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2022-05-19 07:39:39] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2022-05-19 07:39:39] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2022-05-19 07:39:39] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2022-05-19 07:39:40] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2022-05-19 07:39:40] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:39:40] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2022-05-19 07:39:40] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2022-05-19 07:39:40] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-19 07:39:40] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-19 07:39:41] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2022-05-19 07:39:41] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2022-05-19 07:39:41] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2022-05-19 07:39:41] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2022-05-19 07:39:42] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2022-05-19 07:39:42] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2022-05-19 07:39:42] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2022-05-19 07:39:42] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 2 ms to minimize.
[2022-05-19 07:39:43] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 2 ms to minimize.
[2022-05-19 07:39:43] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2022-05-19 07:39:43] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2022-05-19 07:39:43] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2022-05-19 07:39:44] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2022-05-19 07:39:44] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2022-05-19 07:39:44] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2022-05-19 07:39:44] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:39:44] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2022-05-19 07:39:45] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-05-19 07:39:45] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2022-05-19 07:39:45] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-19 07:39:45] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-19 07:39:45] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2022-05-19 07:39:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-19 07:39:46] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2022-05-19 07:39:46] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7623 ms
[2022-05-19 07:39:46] [INFO ] After 8876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-05-19 07:39:46] [INFO ] After 9514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 79 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 68 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:39:46] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:39:48] [INFO ] Implicit Places using invariants in 1518 ms returned []
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:39:48] [INFO ] Computed 900 place invariants in 20 ms
[2022-05-19 07:39:52] [INFO ] Implicit Places using invariants and state equation in 4525 ms returned []
Implicit Place search using SMT with State Equation took 6049 ms to find 0 implicit places.
[2022-05-19 07:39:52] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:39:52] [INFO ] Computed 900 place invariants in 21 ms
[2022-05-19 07:39:53] [INFO ] Dead Transitions using invariants and state equation in 1203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:39:54] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 07:39:54] [INFO ] [Real]Absence check using 899 positive place invariants in 161 ms returned sat
[2022-05-19 07:39:54] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:39:55] [INFO ] After 1716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:39:56] [INFO ] [Nat]Absence check using 899 positive place invariants in 178 ms returned sat
[2022-05-19 07:39:56] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:39:57] [INFO ] After 1265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:39:57] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2022-05-19 07:39:58] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2022-05-19 07:39:58] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2022-05-19 07:39:58] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-19 07:39:58] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2022-05-19 07:39:59] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2022-05-19 07:39:59] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2022-05-19 07:39:59] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2022-05-19 07:39:59] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2022-05-19 07:39:59] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-05-19 07:39:59] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2022-05-19 07:40:00] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-19 07:40:00] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2022-05-19 07:40:00] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2022-05-19 07:40:00] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2022-05-19 07:40:01] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2022-05-19 07:40:01] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2022-05-19 07:40:01] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2022-05-19 07:40:01] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2022-05-19 07:40:02] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2022-05-19 07:40:02] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2022-05-19 07:40:02] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2022-05-19 07:40:02] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2022-05-19 07:40:03] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2022-05-19 07:40:03] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-05-19 07:40:03] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2022-05-19 07:40:03] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2022-05-19 07:40:03] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2022-05-19 07:40:04] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-19 07:40:04] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-05-19 07:40:04] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:40:04] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-05-19 07:40:04] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2022-05-19 07:40:04] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-19 07:40:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-19 07:40:05] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7520 ms
[2022-05-19 07:40:05] [INFO ] After 8853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-19 07:40:05] [INFO ] After 9551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND p2 (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X p2)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 1035 ms. Reduced automaton from 6 states, 19 edges and 3 AP to 6 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 1128 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:40:07] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:40:08] [INFO ] Implicit Places using invariants in 1146 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:40:08] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:40:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:40:10] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2870 ms to find 0 implicit places.
[2022-05-19 07:40:10] [INFO ] Redundant transitions in 248 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:40:10] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:40:12] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND p2 (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X p2)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 861 ms. Reduced automaton from 6 states, 19 edges and 3 AP to 6 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:40:13] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 07:40:13] [INFO ] [Real]Absence check using 901 positive place invariants in 161 ms returned sat
[2022-05-19 07:40:15] [INFO ] After 1704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:40:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 162 ms returned sat
[2022-05-19 07:40:16] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:40:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:40:16] [INFO ] After 107ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:40:17] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-05-19 07:40:17] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:40:17] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-05-19 07:40:17] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-19 07:40:17] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:40:17] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:40:17] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-19 07:40:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1058 ms
[2022-05-19 07:40:18] [INFO ] After 1233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-19 07:40:18] [INFO ] After 3069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 206 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 0 with 698 rules applied. Total rules applied 698 place count 2501 transition count 2400
Applied a total of 698 rules in 135 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 169999 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169999 steps, saw 167539 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:40:21] [INFO ] Computed 901 place invariants in 29 ms
[2022-05-19 07:40:22] [INFO ] [Real]Absence check using 900 positive place invariants in 168 ms returned sat
[2022-05-19 07:40:22] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:40:23] [INFO ] After 1858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:40:24] [INFO ] [Nat]Absence check using 900 positive place invariants in 171 ms returned sat
[2022-05-19 07:40:24] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:40:25] [INFO ] After 1223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:40:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:40:25] [INFO ] After 91ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:40:25] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2022-05-19 07:40:26] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2022-05-19 07:40:26] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2022-05-19 07:40:26] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2022-05-19 07:40:26] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2022-05-19 07:40:27] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2022-05-19 07:40:27] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2022-05-19 07:40:27] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2022-05-19 07:40:27] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2022-05-19 07:40:27] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2022-05-19 07:40:28] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-19 07:40:28] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2022-05-19 07:40:28] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2022-05-19 07:40:28] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2022-05-19 07:40:28] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-05-19 07:40:29] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2022-05-19 07:40:29] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2022-05-19 07:40:29] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2022-05-19 07:40:29] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2022-05-19 07:40:29] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2022-05-19 07:40:30] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2022-05-19 07:40:30] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2022-05-19 07:40:30] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2022-05-19 07:40:30] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2022-05-19 07:40:30] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2022-05-19 07:40:31] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-19 07:40:31] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2022-05-19 07:40:31] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2022-05-19 07:40:31] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-05-19 07:40:31] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2022-05-19 07:40:31] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2022-05-19 07:40:32] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2022-05-19 07:40:32] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2022-05-19 07:40:32] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2022-05-19 07:40:32] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2022-05-19 07:40:32] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2022-05-19 07:40:32] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2022-05-19 07:40:33] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2022-05-19 07:40:33] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2022-05-19 07:40:33] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7775 ms
[2022-05-19 07:40:33] [INFO ] After 7953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-19 07:40:33] [INFO ] After 9859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 199 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 68 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 67 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:40:33] [INFO ] Computed 901 place invariants in 30 ms
[2022-05-19 07:40:35] [INFO ] Implicit Places using invariants in 1489 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:40:35] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 07:40:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:40:40] [INFO ] Implicit Places using invariants and state equation in 5549 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7045 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174964 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174964 steps, saw 172395 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:40:44] [INFO ] Computed 900 place invariants in 30 ms
[2022-05-19 07:40:44] [INFO ] [Real]Absence check using 899 positive place invariants in 156 ms returned sat
[2022-05-19 07:40:44] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:40:46] [INFO ] After 1760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:40:46] [INFO ] [Nat]Absence check using 899 positive place invariants in 168 ms returned sat
[2022-05-19 07:40:46] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:40:47] [INFO ] After 1231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:40:48] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2022-05-19 07:40:48] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2022-05-19 07:40:48] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2022-05-19 07:40:48] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2022-05-19 07:40:49] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2022-05-19 07:40:49] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2022-05-19 07:40:49] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2022-05-19 07:40:49] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2022-05-19 07:40:49] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:40:49] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-19 07:40:50] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2022-05-19 07:40:50] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-19 07:40:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2022-05-19 07:40:50] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2022-05-19 07:40:51] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2022-05-19 07:40:51] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2022-05-19 07:40:51] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2022-05-19 07:40:51] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2022-05-19 07:40:52] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2022-05-19 07:40:52] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2022-05-19 07:40:52] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2022-05-19 07:40:52] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2022-05-19 07:40:53] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2022-05-19 07:40:53] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2022-05-19 07:40:53] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-19 07:40:53] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2022-05-19 07:40:53] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2022-05-19 07:40:54] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2022-05-19 07:40:54] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2022-05-19 07:40:54] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2022-05-19 07:40:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-19 07:40:54] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2022-05-19 07:40:55] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2022-05-19 07:40:55] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-05-19 07:40:55] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2022-05-19 07:40:55] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7602 ms
[2022-05-19 07:40:55] [INFO ] After 8912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-19 07:40:55] [INFO ] After 9520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 83 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 67 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:40:55] [INFO ] Computed 900 place invariants in 30 ms
[2022-05-19 07:40:57] [INFO ] Implicit Places using invariants in 1480 ms returned []
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:40:57] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:41:01] [INFO ] Implicit Places using invariants and state equation in 4574 ms returned []
Implicit Place search using SMT with State Equation took 6056 ms to find 0 implicit places.
[2022-05-19 07:41:01] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:41:01] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 07:41:03] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 07:41:03] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 07:41:03] [INFO ] [Real]Absence check using 899 positive place invariants in 173 ms returned sat
[2022-05-19 07:41:03] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-19 07:41:05] [INFO ] After 1793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:41:05] [INFO ] [Nat]Absence check using 899 positive place invariants in 175 ms returned sat
[2022-05-19 07:41:05] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:41:06] [INFO ] After 1283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:41:07] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2022-05-19 07:41:07] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2022-05-19 07:41:07] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2022-05-19 07:41:07] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2022-05-19 07:41:08] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2022-05-19 07:41:08] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2022-05-19 07:41:08] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2022-05-19 07:41:08] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2022-05-19 07:41:08] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:41:09] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-19 07:41:09] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-05-19 07:41:09] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-19 07:41:09] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-19 07:41:09] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2022-05-19 07:41:10] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2022-05-19 07:41:10] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2022-05-19 07:41:10] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2022-05-19 07:41:10] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2022-05-19 07:41:11] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2022-05-19 07:41:11] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2022-05-19 07:41:11] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2022-05-19 07:41:11] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2022-05-19 07:41:12] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2022-05-19 07:41:12] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2022-05-19 07:41:12] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2022-05-19 07:41:12] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2022-05-19 07:41:13] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:41:13] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2022-05-19 07:41:13] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2022-05-19 07:41:13] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-05-19 07:41:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:41:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-19 07:41:14] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-19 07:41:14] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-19 07:41:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2022-05-19 07:41:14] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7497 ms
[2022-05-19 07:41:14] [INFO ] After 8851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 07:41:14] [INFO ] After 9555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (AND p2 (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X p2)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 915 ms. Reduced automaton from 6 states, 19 edges and 3 AP to 6 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 531 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p2) p1), true, false, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 30796 reset in 5808 ms.
Product exploration explored 100000 steps with 30811 reset in 6047 ms.
Built C files in :
/tmp/ltsmin1573394594646153234
[2022-05-19 07:41:28] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:41:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1573394594646153234
Running compilation step : cd /tmp/ltsmin1573394594646153234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1573394594646153234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1573394594646153234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:41:31] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:41:33] [INFO ] Implicit Places using invariants in 1278 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:41:33] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:41:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:41:34] [INFO ] Implicit Places using invariants and state equation in 1840 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
[2022-05-19 07:41:35] [INFO ] Redundant transitions in 242 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:41:35] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 07:41:36] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin13311949371122627832
[2022-05-19 07:41:36] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:41:36] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13311949371122627832
Running compilation step : cd /tmp/ltsmin13311949371122627832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13311949371122627832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13311949371122627832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:41:39] [INFO ] Flatten gal took : 138 ms
[2022-05-19 07:41:39] [INFO ] Flatten gal took : 137 ms
[2022-05-19 07:41:39] [INFO ] Time to serialize gal into /tmp/LTL4059371593201653850.gal : 8 ms
[2022-05-19 07:41:39] [INFO ] Time to serialize properties into /tmp/LTL2045652963612621101.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4059371593201653850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2045652963612621101.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4059371...266
Read 1 LTL properties
Checking formula 0 : !((G((F(X(!((F(!("((p2194==0)||(p772==1))")))U(X("(p2479==1)"))))))&&("((p138==0)||(p1637==1))"))))
Formula 0 simplified : !G("((p138==0)||(p1637==1))" & FX!(F!"((p2194==0)||(p772==1))" U X"(p2479==1)"))
Detected timeout of ITS tools.
[2022-05-19 07:41:54] [INFO ] Flatten gal took : 133 ms
[2022-05-19 07:41:54] [INFO ] Applying decomposition
[2022-05-19 07:41:55] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9487212477927288969.txt' '-o' '/tmp/graph9487212477927288969.bin' '-w' '/tmp/graph9487212477927288969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9487212477927288969.bin' '-l' '-1' '-v' '-w' '/tmp/graph9487212477927288969.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:41:55] [INFO ] Decomposing Gal with order
[2022-05-19 07:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:41:55] [INFO ] Removed a total of 1595 redundant transitions.
[2022-05-19 07:41:55] [INFO ] Flatten gal took : 138 ms
[2022-05-19 07:41:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1568 labels/synchronizations in 189 ms.
[2022-05-19 07:41:55] [INFO ] Time to serialize gal into /tmp/LTL9469569671295115505.gal : 14 ms
[2022-05-19 07:41:55] [INFO ] Time to serialize properties into /tmp/LTL3872471780942953987.ltl : 52 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9469569671295115505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3872471780942953987.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9469569...245
Read 1 LTL properties
Checking formula 0 : !((G((F(X(!((F(!("((i38.i1.i2.u790.p2194==0)||(i12.i1.i1.u278.p772==1))")))U(X("(i43.i2.i0.u892.p2479==1)"))))))&&("((i2.i1.i2.u50.p13...193
Formula 0 simplified : !G("((i2.i1.i2.u50.p138==0)||(i27.i1.i2.u590.p1637==1))" & FX!(F!"((i38.i1.i2.u790.p2194==0)||(i12.i1.i1.u278.p772==1))" U X"(i43.i2...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13133348265189434975
[2022-05-19 07:42:10] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13133348265189434975
Running compilation step : cd /tmp/ltsmin13133348265189434975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13133348265189434975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13133348265189434975;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-13 finished in 207813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||G((X(p1) U !X(!X(p2))))))))'
Found a SL insensitive property : ShieldIIPs-PT-100A-LTLCardinality-00
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 163 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:42:14] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:42:15] [INFO ] Implicit Places using invariants in 1233 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:42:15] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:42:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:42:17] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:42:17] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:42:18] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s553 0) (EQ s1396 1)), p1:(EQ s1535 1), p2:(OR (EQ s210 0) (EQ s73 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33380 reset in 6223 ms.
Product exploration explored 100000 steps with 33330 reset in 6445 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1220 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:42:34] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:42:34] [INFO ] [Real]Absence check using 901 positive place invariants in 162 ms returned sat
[2022-05-19 07:42:37] [INFO ] After 3564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-19 07:42:38] [INFO ] [Nat]Absence check using 901 positive place invariants in 164 ms returned sat
[2022-05-19 07:43:02] [INFO ] After 23900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 07:43:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:43:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:43:02] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1426 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 697 place count 2501 transition count 2401
Applied a total of 697 rules in 136 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 83981 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{4=1, 8=1}
Probabilistic random walk after 83981 steps, saw 82608 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:43:08] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 07:43:09] [INFO ] [Real]Absence check using 900 positive place invariants in 168 ms returned sat
[2022-05-19 07:43:09] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:43:11] [INFO ] After 3151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:43:12] [INFO ] [Nat]Absence check using 900 positive place invariants in 164 ms returned sat
[2022-05-19 07:43:12] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:43:36] [INFO ] After 24011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:43:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:43:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:43:36] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 452 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 71 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 88728 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88728 steps, saw 87301 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:43:41] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 07:43:42] [INFO ] [Real]Absence check using 900 positive place invariants in 161 ms returned sat
[2022-05-19 07:43:42] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:43:44] [INFO ] After 3077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:43:45] [INFO ] [Nat]Absence check using 900 positive place invariants in 160 ms returned sat
[2022-05-19 07:43:45] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:44:09] [INFO ] After 24049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:44:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:44:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:44:09] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:09] [INFO ] Computed 901 place invariants in 27 ms
[2022-05-19 07:44:11] [INFO ] Implicit Places using invariants in 1386 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:11] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 07:44:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:44:16] [INFO ] Implicit Places using invariants and state equation in 5726 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7114 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 1189 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 66 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:18] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:44:19] [INFO ] Implicit Places using invariants in 1105 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:19] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:44:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:44:21] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:21] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:44:22] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 942 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:24] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:44:25] [INFO ] [Real]Absence check using 901 positive place invariants in 209 ms returned sat
[2022-05-19 07:44:28] [INFO ] After 3547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-19 07:44:29] [INFO ] [Nat]Absence check using 901 positive place invariants in 161 ms returned sat
[2022-05-19 07:44:53] [INFO ] After 23887ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 07:44:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:44:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:44:53] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1449 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 697 place count 2501 transition count 2401
Applied a total of 697 rules in 142 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 81222 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{4=1, 8=1}
Probabilistic random walk after 81222 steps, saw 79881 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:59] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 07:45:00] [INFO ] [Real]Absence check using 900 positive place invariants in 161 ms returned sat
[2022-05-19 07:45:00] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 07:45:02] [INFO ] After 3091ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:45:03] [INFO ] [Nat]Absence check using 900 positive place invariants in 157 ms returned sat
[2022-05-19 07:45:03] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:45:27] [INFO ] After 24043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 07:45:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:45:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:45:27] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 392 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 94346 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94346 steps, saw 92854 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:45:32] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 07:45:32] [INFO ] [Real]Absence check using 900 positive place invariants in 168 ms returned sat
[2022-05-19 07:45:32] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-19 07:45:35] [INFO ] After 3121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 07:45:36] [INFO ] [Nat]Absence check using 900 positive place invariants in 158 ms returned sat
[2022-05-19 07:45:36] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 07:46:00] [INFO ] After 23967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:46:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:46:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:46:00] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 68 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:00] [INFO ] Computed 901 place invariants in 26 ms
[2022-05-19 07:46:01] [INFO ] Implicit Places using invariants in 1436 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:01] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 07:46:03] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
[2022-05-19 07:46:03] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:03] [INFO ] Computed 901 place invariants in 26 ms
[2022-05-19 07:46:04] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 1084 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33369 reset in 6262 ms.
Product exploration explored 100000 steps with 33200 reset in 6452 ms.
Built C files in :
/tmp/ltsmin6072106565767443285
[2022-05-19 07:46:19] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6072106565767443285
Running compilation step : cd /tmp/ltsmin6072106565767443285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6072106565767443285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6072106565767443285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 66 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:22] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:46:23] [INFO ] Implicit Places using invariants in 1212 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:23] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:46:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:46:25] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2949 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:25] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:46:26] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin18334311156114955551
[2022-05-19 07:46:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18334311156114955551
Running compilation step : cd /tmp/ltsmin18334311156114955551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18334311156114955551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18334311156114955551;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:46:29] [INFO ] Flatten gal took : 133 ms
[2022-05-19 07:46:29] [INFO ] Flatten gal took : 136 ms
[2022-05-19 07:46:29] [INFO ] Time to serialize gal into /tmp/LTL13352639856229053879.gal : 8 ms
[2022-05-19 07:46:29] [INFO ] Time to serialize properties into /tmp/LTL6189562703943011365.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13352639856229053879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6189562703943011365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1335263...267
Read 1 LTL properties
Checking formula 0 : !((F(G((X("((p553==0)&&(p1396==1))"))||(G((X("(p1535==1)"))U(!(X(!(X("((p210==0)||(p73==1))")))))))))))
Formula 0 simplified : !FG(X"((p553==0)&&(p1396==1))" | G(X"(p1535==1)" U !X!X"((p210==0)||(p73==1))"))
Detected timeout of ITS tools.
[2022-05-19 07:46:45] [INFO ] Flatten gal took : 137 ms
[2022-05-19 07:46:45] [INFO ] Applying decomposition
[2022-05-19 07:46:45] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2220320543704247450.txt' '-o' '/tmp/graph2220320543704247450.bin' '-w' '/tmp/graph2220320543704247450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2220320543704247450.bin' '-l' '-1' '-v' '-w' '/tmp/graph2220320543704247450.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:46:45] [INFO ] Decomposing Gal with order
[2022-05-19 07:46:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:46:45] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-19 07:46:45] [INFO ] Flatten gal took : 128 ms
[2022-05-19 07:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 164 ms.
[2022-05-19 07:46:45] [INFO ] Time to serialize gal into /tmp/LTL4817429590073750422.gal : 18 ms
[2022-05-19 07:46:45] [INFO ] Time to serialize properties into /tmp/LTL7981651056327179649.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4817429590073750422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7981651056327179649.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4817429...245
Read 1 LTL properties
Checking formula 0 : !((F(G((X("((i10.i1.i1.u199.p553==0)&&(i24.i0.i2.u503.p1396==1))"))||(G((X("(i26.i1.i0.u553.p1535==1)"))U(!(X(!(X("((i4.i0.i0.u76.p210...195
Formula 0 simplified : !FG(X"((i10.i1.i1.u199.p553==0)&&(i24.i0.i2.u503.p1396==1))" | G(X"(i26.i1.i0.u553.p1535==1)" U !X!X"((i4.i0.i0.u76.p210==0)||(i1.i0...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13816626262477419230
[2022-05-19 07:47:01] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13816626262477419230
Running compilation step : cd /tmp/ltsmin13816626262477419230;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13816626262477419230;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13816626262477419230;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-00 finished in 290125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !p1))'
Found a SL insensitive property : ShieldIIPs-PT-100A-LTLCardinality-09
Stuttering acceptance computed with spot in 75 ms :[true, p1, (OR (NOT p0) p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 153 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:04] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:47:05] [INFO ] Implicit Places using invariants in 1161 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:05] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:47:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:47:07] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:07] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:47:08] [INFO ] Dead Transitions using invariants and state equation in 1180 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1539 0) (EQ s1210 1)), p0:(OR (EQ s1227 0) (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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 38 reset in 1326 ms.
Product exploration explored 100000 steps with 38 reset in 1667 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:12] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:47:12] [INFO ] [Real]Absence check using 901 positive place invariants in 174 ms returned sat
[2022-05-19 07:47:13] [INFO ] After 1770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:47:14] [INFO ] [Nat]Absence check using 901 positive place invariants in 163 ms returned sat
[2022-05-19 07:47:21] [INFO ] After 7452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:47:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:47:24] [INFO ] After 2704ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:47:28] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2022-05-19 07:47:28] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-19 07:47:28] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-19 07:47:28] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-05-19 07:47:29] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-19 07:47:29] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2022-05-19 07:47:29] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-19 07:47:29] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2022-05-19 07:47:29] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2022-05-19 07:47:30] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2022-05-19 07:47:30] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2022-05-19 07:47:30] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:47:30] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2022-05-19 07:47:31] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2022-05-19 07:47:31] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2022-05-19 07:47:31] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:47:31] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-19 07:47:31] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-19 07:47:31] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2022-05-19 07:47:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-19 07:47:32] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-19 07:47:32] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2022-05-19 07:47:32] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2022-05-19 07:47:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-05-19 07:47:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-05-19 07:47:33] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5247 ms
[2022-05-19 07:47:33] [INFO ] After 11177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1563 ms.
[2022-05-19 07:47:34] [INFO ] After 20731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 251 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 0 with 698 rules applied. Total rules applied 698 place count 2501 transition count 2401
Applied a total of 698 rules in 138 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25246 steps, run visited all 1 properties in 458 ms. (steps per millisecond=55 )
Probabilistic random walk after 25246 steps, saw 24484 distinct states, run finished after 460 ms. (steps per millisecond=54 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:36] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:47:40] [INFO ] [Real]Absence check using 901 positive place invariants in 1234 ms returned sat
[2022-05-19 07:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:47:51] [INFO ] [Real]Absence check using state equation in 11067 ms returned unknown
Could not prove EG p1
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 57 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:51] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:47:52] [INFO ] Implicit Places using invariants in 1133 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:52] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:47:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:47:54] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:54] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:47:55] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:55] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:47:56] [INFO ] [Real]Absence check using 901 positive place invariants in 167 ms returned sat
[2022-05-19 07:47:57] [INFO ] After 1752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:47:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 162 ms returned sat
[2022-05-19 07:48:05] [INFO ] After 6904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:48:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:48:07] [INFO ] After 2632ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:48:11] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-19 07:48:11] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-19 07:48:11] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-19 07:48:11] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-05-19 07:48:12] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-05-19 07:48:12] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-05-19 07:48:12] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2022-05-19 07:48:12] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2022-05-19 07:48:13] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-05-19 07:48:13] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:48:13] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2022-05-19 07:48:13] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2022-05-19 07:48:13] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-05-19 07:48:14] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-05-19 07:48:14] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:48:14] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-19 07:48:14] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2022-05-19 07:48:14] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2022-05-19 07:48:14] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-19 07:48:15] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-19 07:48:15] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-19 07:48:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 07:48:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-05-19 07:48:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-19 07:48:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2022-05-19 07:48:15] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5112 ms
[2022-05-19 07:48:16] [INFO ] After 10954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1549 ms.
[2022-05-19 07:48:17] [INFO ] After 19947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 262 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 0 with 698 rules applied. Total rules applied 698 place count 2501 transition count 2401
Applied a total of 698 rules in 136 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25246 steps, run visited all 1 properties in 437 ms. (steps per millisecond=57 )
Probabilistic random walk after 25246 steps, saw 24484 distinct states, run finished after 439 ms. (steps per millisecond=57 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), true, (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:48:19] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:48:23] [INFO ] [Real]Absence check using 901 positive place invariants in 1234 ms returned sat
[2022-05-19 07:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:48:34] [INFO ] [Real]Absence check using state equation in 11084 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Product exploration explored 100000 steps with 39 reset in 1305 ms.
Product exploration explored 100000 steps with 38 reset in 1660 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true]
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2022-05-19 07:48:37] [INFO ] Redundant transitions in 240 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:37] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:48:39] [INFO ] Dead Transitions using invariants and state equation in 1669 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2501 places, 2400/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2501 places, 2400/2401 transitions.
Product exploration explored 100000 steps with 38 reset in 1308 ms.
Product exploration explored 100000 steps with 38 reset in 1670 ms.
Built C files in :
/tmp/ltsmin17337730459811907403
[2022-05-19 07:48:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17337730459811907403
Running compilation step : cd /tmp/ltsmin17337730459811907403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17337730459811907403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17337730459811907403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 65 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:48:45] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:48:46] [INFO ] Implicit Places using invariants in 1162 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:48:46] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:48:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:48:48] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:48:48] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:48:49] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin16717298752278578209
[2022-05-19 07:48:49] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16717298752278578209
Running compilation step : cd /tmp/ltsmin16717298752278578209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16717298752278578209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16717298752278578209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:48:52] [INFO ] Flatten gal took : 130 ms
[2022-05-19 07:48:53] [INFO ] Flatten gal took : 131 ms
[2022-05-19 07:48:53] [INFO ] Time to serialize gal into /tmp/LTL5041623403058328244.gal : 7 ms
[2022-05-19 07:48:53] [INFO ] Time to serialize properties into /tmp/LTL15307730102293410339.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5041623403058328244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15307730102293410339.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5041623...267
Read 1 LTL properties
Checking formula 0 : !(((X("((p1227==0)||(p73==1))"))U(!("((p1539==0)||(p1210==1))"))))
Formula 0 simplified : !(X"((p1227==0)||(p73==1))" U !"((p1539==0)||(p1210==1))")
Detected timeout of ITS tools.
[2022-05-19 07:49:08] [INFO ] Flatten gal took : 131 ms
[2022-05-19 07:49:08] [INFO ] Applying decomposition
[2022-05-19 07:49:08] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1405346681553037217.txt' '-o' '/tmp/graph1405346681553037217.bin' '-w' '/tmp/graph1405346681553037217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1405346681553037217.bin' '-l' '-1' '-v' '-w' '/tmp/graph1405346681553037217.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:49:08] [INFO ] Decomposing Gal with order
[2022-05-19 07:49:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:49:08] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-19 07:49:08] [INFO ] Flatten gal took : 124 ms
[2022-05-19 07:49:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1532 labels/synchronizations in 163 ms.
[2022-05-19 07:49:09] [INFO ] Time to serialize gal into /tmp/LTL7497628288502883473.gal : 17 ms
[2022-05-19 07:49:09] [INFO ] Time to serialize properties into /tmp/LTL3056839849571664034.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7497628288502883473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3056839849571664034.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7497628...245
Read 1 LTL properties
Checking formula 0 : !(((X("((i20.i1.i0.u441.p1227==0)||(i1.i0.i1.u26.p73==1))"))U(!("((i27.i0.i0.u555.p1539==0)||(i20.i1.i2.u436.p1210==1))"))))
Formula 0 simplified : !(X"((i20.i1.i0.u441.p1227==0)||(i1.i0.i1.u26.p73==1))" U !"((i27.i0.i0.u555.p1539==0)||(i20.i1.i2.u436.p1210==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4802109941104351389
[2022-05-19 07:49:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4802109941104351389
Running compilation step : cd /tmp/ltsmin4802109941104351389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4802109941104351389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4802109941104351389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-09 finished in 143142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a CL insensitive property : ShieldIIPs-PT-100A-LTLCardinality-11
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 151 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:49:27] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:49:28] [INFO ] Implicit Places using invariants in 1219 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:49:28] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:49:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:49:30] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2906 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:49:30] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:49:31] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1685 0) (EQ s1570 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 61 reset in 1297 ms.
Product exploration explored 100000 steps with 61 reset in 1628 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), false]
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:49:35] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:49:36] [INFO ] Implicit Places using invariants in 1258 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:49:36] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:49:37] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 2504 ms to find 0 implicit places.
[2022-05-19 07:49:37] [INFO ] Redundant transitions in 258 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:49:37] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:49:39] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2501 places, 2400/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2501 places, 2400/2401 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), false]
Product exploration explored 100000 steps with 132 reset in 1280 ms.
Product exploration explored 100000 steps with 132 reset in 1618 ms.
Built C files in :
/tmp/ltsmin8224788767958339242
[2022-05-19 07:49:42] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:49:42] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8224788767958339242
Running compilation step : cd /tmp/ltsmin8224788767958339242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8224788767958339242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8224788767958339242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:49:45] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:49:47] [INFO ] Implicit Places using invariants in 1241 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:49:47] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:49:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:49:48] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2920 ms to find 0 implicit places.
[2022-05-19 07:49:49] [INFO ] Redundant transitions in 236 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:49:49] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:49:50] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin8452040496298312898
[2022-05-19 07:49:50] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:49:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8452040496298312898
Running compilation step : cd /tmp/ltsmin8452040496298312898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8452040496298312898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8452040496298312898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:49:53] [INFO ] Flatten gal took : 131 ms
[2022-05-19 07:49:53] [INFO ] Flatten gal took : 132 ms
[2022-05-19 07:49:53] [INFO ] Time to serialize gal into /tmp/LTL14395272887750763354.gal : 7 ms
[2022-05-19 07:49:53] [INFO ] Time to serialize properties into /tmp/LTL16309316976677282103.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14395272887750763354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16309316976677282103.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1439527...268
Read 1 LTL properties
Checking formula 0 : !((X(F("((p1685==0)||(p1570==1))"))))
Formula 0 simplified : !XF"((p1685==0)||(p1570==1))"
Detected timeout of ITS tools.
[2022-05-19 07:50:08] [INFO ] Flatten gal took : 133 ms
[2022-05-19 07:50:08] [INFO ] Applying decomposition
[2022-05-19 07:50:08] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5295091564759248745.txt' '-o' '/tmp/graph5295091564759248745.bin' '-w' '/tmp/graph5295091564759248745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5295091564759248745.bin' '-l' '-1' '-v' '-w' '/tmp/graph5295091564759248745.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:50:09] [INFO ] Decomposing Gal with order
[2022-05-19 07:50:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:50:09] [INFO ] Removed a total of 1595 redundant transitions.
[2022-05-19 07:50:09] [INFO ] Flatten gal took : 122 ms
[2022-05-19 07:50:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1540 labels/synchronizations in 182 ms.
[2022-05-19 07:50:09] [INFO ] Time to serialize gal into /tmp/LTL8153709328840662140.gal : 12 ms
[2022-05-19 07:50:09] [INFO ] Time to serialize properties into /tmp/LTL10245521086144894536.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8153709328840662140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10245521086144894536.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8153709...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i28.i1.i2.u607.p1685==0)||(i26.i1.i0.u566.p1570==1))"))))
Formula 0 simplified : !XF"((i28.i1.i2.u607.p1685==0)||(i26.i1.i0.u566.p1570==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9000881462908313277
[2022-05-19 07:50:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9000881462908313277
Running compilation step : cd /tmp/ltsmin9000881462908313277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9000881462908313277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9000881462908313277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-11 finished in 60575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(!(F(!p0) U X(p1))))&&p2)))'
[2022-05-19 07:50:28] [INFO ] Flatten gal took : 132 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10514255586203435232
[2022-05-19 07:50:28] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:50:28] [INFO ] Applying decomposition
[2022-05-19 07:50:28] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10514255586203435232
Running compilation step : cd /tmp/ltsmin10514255586203435232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 07:50:28] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7119108748220439671.txt' '-o' '/tmp/graph7119108748220439671.bin' '-w' '/tmp/graph7119108748220439671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7119108748220439671.bin' '-l' '-1' '-v' '-w' '/tmp/graph7119108748220439671.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:50:28] [INFO ] Decomposing Gal with order
[2022-05-19 07:50:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:50:28] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 07:50:28] [INFO ] Flatten gal took : 130 ms
[2022-05-19 07:50:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1564 labels/synchronizations in 161 ms.
[2022-05-19 07:50:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality12283681144588416035.gal : 17 ms
[2022-05-19 07:50:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality2624351940862144134.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12283681144588416035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2624351940862144134.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 4 LTL properties
Checking formula 0 : !((F(G((X("((i10.i1.i0.u199.p553==0)&&(i25.i0.i1.u503.p1396==1))"))||(G((X("(i28.i0.i0.u553.p1535==1)"))U(!(X(!(X("((i3.i2.i1.u76.p210...195
Formula 0 simplified : !FG(X"((i10.i1.i0.u199.p553==0)&&(i25.i0.i1.u503.p1396==1))" | G(X"(i28.i0.i0.u553.p1535==1)" U !X!X"((i3.i2.i1.u76.p210==0)||(i1.i0...174
Compilation finished in 7697 ms.
Running link step : cd /tmp/ltsmin10514255586203435232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10514255586203435232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true))||[]((X((LTLAPp1==true)) U !X(!X((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10514255586203435232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((LTLAPp0==true))||[]((X((LTLAPp1==true)) U !X(!X((LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10514255586203435232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp3==true)) U !(LTLAPp4==true))' '--buchi-type=spotba'
LTSmin run took 12545 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10514255586203435232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 08:18:17] [INFO ] Applying decomposition
[2022-05-19 08:18:18] [INFO ] Flatten gal took : 355 ms
[2022-05-19 08:18:18] [INFO ] Decomposing Gal with order
[2022-05-19 08:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:18:19] [INFO ] Removed a total of 1700 redundant transitions.
[2022-05-19 08:18:19] [INFO ] Flatten gal took : 387 ms
[2022-05-19 08:18:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 283 ms.
[2022-05-19 08:18:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality16083800975249765886.gal : 17 ms
[2022-05-19 08:18:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality7634516431267047355.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16083800975249765886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7634516431267047355.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 3 LTL properties
Checking formula 0 : !((F(G((X("((u222.p553==0)&&(u560.p1396==1))"))||(G((X("(u616.p1535==1)"))U(!(X(!(X("((u86.p210==0)||(u30.p73==1))")))))))))))
Formula 0 simplified : !FG(X"((u222.p553==0)&&(u560.p1396==1))" | G(X"(u616.p1535==1)" U !X!X"((u86.p210==0)||(u30.p73==1))"))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10514255586203435232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10514255586203435232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(X(!(<>(!(LTLAPp6==true)) U X((LTLAPp7==true)))))&&(LTLAPp8==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100A"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-100A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286024800163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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