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-165286025300500.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 ShieldPPPs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 03:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 03:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:23 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.7K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 447K 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 ShieldPPPs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653005759932

Running Version 202205111006
[2022-05-20 00:16:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-20 00:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 00:16:01] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-05-20 00:16:01] [INFO ] Transformed 1553 places.
[2022-05-20 00:16:01] [INFO ] Transformed 1303 transitions.
[2022-05-20 00:16:01] [INFO ] Found NUPN structural information;
[2022-05-20 00:16:01] [INFO ] Parsed PT model containing 1553 places and 1303 transitions in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-050A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 199 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:16:01] [INFO ] Computed 551 place invariants in 34 ms
[2022-05-20 00:16:02] [INFO ] Implicit Places using invariants in 1057 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:16:02] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:16:04] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2967 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:16:04] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:16:05] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 47 out of 1553 places after structural reductions.
[2022-05-20 00:16:06] [INFO ] Flatten gal took : 525 ms
[2022-05-20 00:16:06] [INFO ] Flatten gal took : 108 ms
[2022-05-20 00:16:06] [INFO ] Input system was already deterministic with 1303 transitions.
Support contains 46 out of 1553 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:16:07] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:16:07] [INFO ] [Real]Absence check using 551 positive place invariants in 90 ms returned sat
[2022-05-20 00:16:08] [INFO ] After 636ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-20 00:16:08] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 5 ms to minimize.
[2022-05-20 00:16:08] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2022-05-20 00:16:09] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2022-05-20 00:16:09] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2022-05-20 00:16:09] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2022-05-20 00:16:09] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2022-05-20 00:16:09] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2022-05-20 00:16:09] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-20 00:16:10] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2022-05-20 00:16:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-05-20 00:16:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1798 ms
[2022-05-20 00:16:10] [INFO ] After 2594ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 00:16:10] [INFO ] After 3088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 00:16:10] [INFO ] [Nat]Absence check using 551 positive place invariants in 98 ms returned sat
[2022-05-20 00:16:11] [INFO ] After 635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 00:16:11] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2022-05-20 00:16:11] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2022-05-20 00:16:12] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2022-05-20 00:16:12] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2022-05-20 00:16:12] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-05-20 00:16:12] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2022-05-20 00:16:12] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2022-05-20 00:16:12] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2022-05-20 00:16:13] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2022-05-20 00:16:13] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2022-05-20 00:16:13] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2022-05-20 00:16:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1837 ms
[2022-05-20 00:16:13] [INFO ] After 2619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 125 ms.
[2022-05-20 00:16:13] [INFO ] After 3187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 54 ms.
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 0 with 446 rules applied. Total rules applied 450 place count 1551 transition count 1301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 451 place count 1550 transition count 1300
Applied a total of 451 rules in 282 ms. Remains 1550 /1553 variables (removed 3) and now considering 1300/1303 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1550/1553 places, 1300/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 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 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 138131 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138131 steps, saw 136741 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:17] [INFO ] Computed 551 place invariants in 86 ms
[2022-05-20 00:16:17] [INFO ] [Real]Absence check using 530 positive place invariants in 87 ms returned sat
[2022-05-20 00:16:17] [INFO ] [Real]Absence check using 530 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-20 00:16:18] [INFO ] After 1211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 00:16:19] [INFO ] [Nat]Absence check using 530 positive place invariants in 89 ms returned sat
[2022-05-20 00:16:19] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 6 ms returned sat
[2022-05-20 00:16:20] [INFO ] After 1257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 00:16:20] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2022-05-20 00:16:20] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-05-20 00:16:20] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2022-05-20 00:16:21] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-20 00:16:21] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2022-05-20 00:16:21] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2022-05-20 00:16:23] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2022-05-20 00:16:23] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2022-05-20 00:16:23] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-20 00:16:23] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2022-05-20 00:16:23] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-20 00:16:24] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
[2022-05-20 00:16:29] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2022-05-20 00:16:29] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2022-05-20 00:16:30] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2022-05-20 00:16:30] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2022-05-20 00:16:30] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2022-05-20 00:16:30] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2022-05-20 00:16:30] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2022-05-20 00:16:30] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2022-05-20 00:16:31] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2022-05-20 00:16:31] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2022-05-20 00:16:31] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2022-05-20 00:16:31] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-05-20 00:16:31] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-20 00:16:31] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2022-05-20 00:16:32] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2022-05-20 00:16:32] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-05-20 00:16:32] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-05-20 00:16:32] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-05-20 00:16:32] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-05-20 00:16:32] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2022-05-20 00:16:33] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2022-05-20 00:16:33] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 5 ms to minimize.
[2022-05-20 00:16:33] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2022-05-20 00:16:34] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2022-05-20 00:16:34] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-05-20 00:16:34] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2022-05-20 00:16:34] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2022-05-20 00:16:34] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2022-05-20 00:16:35] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2022-05-20 00:16:35] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2022-05-20 00:16:35] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-20 00:16:35] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 3 ms to minimize.
[2022-05-20 00:16:35] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-05-20 00:16:35] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2022-05-20 00:16:36] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2022-05-20 00:16:36] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2022-05-20 00:16:36] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-20 00:16:36] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2022-05-20 00:16:36] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2022-05-20 00:16:36] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 16312 ms
[2022-05-20 00:16:36] [INFO ] After 17740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-05-20 00:16:36] [INFO ] After 18305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 136 ms.
Support contains 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 82 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1550/1550 places, 1300/1300 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 75 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:37] [INFO ] Computed 551 place invariants in 52 ms
[2022-05-20 00:16:38] [INFO ] Implicit Places using invariants in 1040 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:38] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:16:40] [INFO ] Implicit Places using invariants and state equation in 2183 ms returned []
Implicit Place search using SMT with State Equation took 3225 ms to find 0 implicit places.
[2022-05-20 00:16:40] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:40] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:16:41] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 45 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:41] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 00:16:41] [INFO ] [Real]Absence check using 530 positive place invariants in 87 ms returned sat
[2022-05-20 00:16:41] [INFO ] [Real]Absence check using 530 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-20 00:16:42] [INFO ] After 1165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 00:16:43] [INFO ] [Nat]Absence check using 530 positive place invariants in 89 ms returned sat
[2022-05-20 00:16:43] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-20 00:16:44] [INFO ] After 1295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 00:16:44] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-05-20 00:16:44] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-05-20 00:16:44] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2022-05-20 00:16:45] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-20 00:16:45] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2022-05-20 00:16:45] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2022-05-20 00:16:47] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2022-05-20 00:16:47] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2022-05-20 00:16:47] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-20 00:16:47] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2022-05-20 00:16:47] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-20 00:16:48] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-20 00:16:53] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-20 00:16:53] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2022-05-20 00:16:53] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2022-05-20 00:16:54] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2022-05-20 00:16:54] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2022-05-20 00:16:54] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2022-05-20 00:16:54] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2022-05-20 00:16:54] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2022-05-20 00:16:54] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2022-05-20 00:16:55] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2022-05-20 00:16:55] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-20 00:16:55] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-05-20 00:16:55] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2022-05-20 00:16:55] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-05-20 00:16:55] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2022-05-20 00:16:56] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2022-05-20 00:16:56] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-05-20 00:16:56] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2022-05-20 00:16:56] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-05-20 00:16:56] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-05-20 00:16:57] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2022-05-20 00:16:57] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2022-05-20 00:16:57] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2022-05-20 00:16:57] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2022-05-20 00:16:58] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2022-05-20 00:16:58] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-20 00:16:58] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2022-05-20 00:16:58] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2022-05-20 00:16:58] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2022-05-20 00:16:58] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2022-05-20 00:16:59] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2022-05-20 00:16:59] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-05-20 00:16:59] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2022-05-20 00:16:59] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2022-05-20 00:16:59] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2022-05-20 00:16:59] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-05-20 00:17:00] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2022-05-20 00:17:00] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2022-05-20 00:17:00] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2022-05-20 00:17:00] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 15962 ms
[2022-05-20 00:17:00] [INFO ] After 17423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-05-20 00:17:00] [INFO ] After 17987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 00:17:00] [INFO ] Flatten gal took : 67 ms
[2022-05-20 00:17:00] [INFO ] Flatten gal took : 64 ms
[2022-05-20 00:17:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14584154321747584608.gal : 37 ms
[2022-05-20 00:17:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11858177292851748256.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12691608537883988284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14584154321747584608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11858177292851748256.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11858177292851748256.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 122
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :122 after 310
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :310 after 4721
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4721 after 228387
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :228387 after 788571
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :788571 after 5.27213e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.27213e+08 after 5.63354e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.63354e+08 after 1.89192e+12
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.89192e+12 after 2.02676e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.02676e+13 after 8.37138e+15
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :8.37138e+15 after 4.08086e+19
Detected timeout of ITS tools.
[2022-05-20 00:17:16] [INFO ] Flatten gal took : 72 ms
[2022-05-20 00:17:16] [INFO ] Applying decomposition
[2022-05-20 00:17:16] [INFO ] Flatten gal took : 57 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/graph7630132481171884032.txt' '-o' '/tmp/graph7630132481171884032.bin' '-w' '/tmp/graph7630132481171884032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7630132481171884032.bin' '-l' '-1' '-v' '-w' '/tmp/graph7630132481171884032.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:17:16] [INFO ] Decomposing Gal with order
[2022-05-20 00:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:17:16] [INFO ] Removed a total of 638 redundant transitions.
[2022-05-20 00:17:16] [INFO ] Flatten gal took : 159 ms
[2022-05-20 00:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1301 labels/synchronizations in 45 ms.
[2022-05-20 00:17:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3135869688596652804.gal : 20 ms
[2022-05-20 00:17:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8947811389025631504.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12691608537883988284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3135869688596652804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8947811389025631504.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality8947811389025631504.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 8695
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8695 after 3.28929e+38
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10220583720856360520
[2022-05-20 00:17:31] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10220583720856360520
Running compilation step : cd /tmp/ltsmin10220583720856360520;'/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'
Compilation finished in 2954 ms.
Running link step : cd /tmp/ltsmin10220583720856360520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10220583720856360520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldPPPs-PT-050A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X(F(X((F(p0)||F(X(G(F(G(F(p1)))))))))))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:47] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:17:48] [INFO ] Implicit Places using invariants in 845 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:48] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:17:49] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2598 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:49] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:17:50] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1107 0), p1:(EQ s554 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2574 ms.
Product exploration explored 100000 steps with 33333 reset in 2552 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-00 finished in 8990 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:56] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:17:57] [INFO ] Implicit Places using invariants in 811 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:57] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:17:58] [INFO ] Implicit Places using invariants and state equation in 1835 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:58] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:17:59] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s473 1) (EQ s494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-01 finished in 3609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U X(p1)))||(X(p2)&&X(G(p3)))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 36 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:59] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:18:00] [INFO ] Implicit Places using invariants in 834 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:00] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:18:02] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:02] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:18:03] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), false, p1, (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 p2 p3), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2 p3), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 p3), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 5}, { cond=(AND p0 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1410 1) (EQ s1452 1)), p1:(EQ s1081 1), p2:(EQ s1081 0), p3:(OR (EQ s1039 0) (EQ s1056 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3175 ms.
Product exploration explored 100000 steps with 50000 reset in 3241 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 p3), (X (NOT (OR (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (AND (NOT p0) p2 p3)), (X (NOT (AND p0 p2 p3))), (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3))))), (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 p1 p2 p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2 p3)))
Knowledge based reduction with 20 factoid took 507 ms. Reduced automaton from 7 states, 22 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-02 finished in 10865 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(G(X(X(p1))))||p0)))&&G(X(p2))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 42 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:10] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:18:11] [INFO ] Implicit Places using invariants in 824 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:11] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:18:13] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2658 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:13] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:18:14] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s43 1) (EQ s45 1)), p0:(OR (EQ s564 0) (EQ s580 0)), p1:(OR (EQ s564 0) (EQ s580 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-03 finished in 3705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(X(p1))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 42 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:14] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:18:15] [INFO ] Implicit Places using invariants in 780 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:15] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:18:17] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2656 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:17] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:18:17] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 476 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1020 1), p0:(OR (AND (EQ s1217 1) (EQ s1238 1)) (EQ s331 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3143 ms.
Product exploration explored 100000 steps with 50000 reset in 3232 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050A-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-05 finished in 10488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(p0)))))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:24] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:18:25] [INFO ] Implicit Places using invariants in 797 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:25] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:18:27] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:27] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:18:28] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1133 0) (EQ s1135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2012 ms.
Product exploration explored 100000 steps with 25000 reset in 2181 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 758 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=75 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 36 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:33] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:18:34] [INFO ] Implicit Places using invariants in 833 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:34] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:18:36] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2709 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:36] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:18:36] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 581 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=72 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1995 ms.
Product exploration explored 100000 steps with 25000 reset in 2125 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 285 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2022-05-20 00:18:42] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:42] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:18:43] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Product exploration explored 100000 steps with 25000 reset in 7002 ms.
Product exploration explored 100000 steps with 25000 reset in 7064 ms.
Built C files in :
/tmp/ltsmin17690961143364506374
[2022-05-20 00:18:57] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17690961143364506374
Running compilation step : cd /tmp/ltsmin17690961143364506374;'/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'
Compilation finished in 2524 ms.
Running link step : cd /tmp/ltsmin17690961143364506374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17690961143364506374;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18200902529719191863.hoa' '--buchi-type=spotba'
LTSmin run took 357 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050A-LTLFireability-06 finished in 35481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (G(p0)||F(p1)||p1)))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:19:00] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:19:01] [INFO ] Implicit Places using invariants in 821 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:19:01] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:19:03] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:19:03] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:19:03] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 500 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1041 1) (EQ s1052 1)), p0:(AND (EQ s1277 1) (EQ s1293 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 124 reset in 942 ms.
Product exploration explored 100000 steps with 125 reset in 1177 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Finished random walk after 803 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=73 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:19:07] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:19:08] [INFO ] [Real]Absence check using 551 positive place invariants in 568 ms returned sat
[2022-05-20 00:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:19:15] [INFO ] [Real]Absence check using state equation in 6900 ms returned sat
[2022-05-20 00:19:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:19:17] [INFO ] [Nat]Absence check using 551 positive place invariants in 403 ms returned sat
[2022-05-20 00:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:19:22] [INFO ] [Nat]Absence check using state equation in 4750 ms returned sat
[2022-05-20 00:19:22] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-05-20 00:19:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2022-05-20 00:19:22] [INFO ] Deduced a trap composed of 18 places in 540 ms of which 0 ms to minimize.
[2022-05-20 00:19:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 909 ms
[2022-05-20 00:19:23] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 74 ms.
[2022-05-20 00:19:31] [INFO ] Deduced a trap composed of 3 places in 782 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:19:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 2 out of 1553 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 117 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:19:31] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:19:32] [INFO ] Implicit Places using invariants in 932 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:19:32] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:19:34] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
[2022-05-20 00:19:34] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:19:34] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:19:35] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 844 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:19:35] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:19:37] [INFO ] [Real]Absence check using 551 positive place invariants in 631 ms returned sat
[2022-05-20 00:19:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:19:44] [INFO ] [Real]Absence check using state equation in 7596 ms returned sat
[2022-05-20 00:19:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:19:46] [INFO ] [Nat]Absence check using 551 positive place invariants in 460 ms returned sat
[2022-05-20 00:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:19:51] [INFO ] [Nat]Absence check using state equation in 5329 ms returned sat
[2022-05-20 00:19:52] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 81 ms.
[2022-05-20 00:20:00] [INFO ] Added : 285 causal constraints over 57 iterations in 8024 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 127 reset in 945 ms.
Product exploration explored 100000 steps with 128 reset in 1107 ms.
Built C files in :
/tmp/ltsmin3781786604470403879
[2022-05-20 00:20:02] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2022-05-20 00:20:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:20:02] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2022-05-20 00:20:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:20:02] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2022-05-20 00:20:02] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:20:02] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3781786604470403879
Running compilation step : cd /tmp/ltsmin3781786604470403879;'/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/ltsmin3781786604470403879;'/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/ltsmin3781786604470403879;'/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 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 49 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:20:05] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:20:06] [INFO ] Implicit Places using invariants in 832 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:20:06] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:20:08] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2675 ms to find 0 implicit places.
[2022-05-20 00:20:08] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:20:08] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:20:08] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin15140149543627744228
[2022-05-20 00:20:09] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2022-05-20 00:20:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:20:09] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2022-05-20 00:20:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:20:09] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2022-05-20 00:20:09] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:20:09] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15140149543627744228
Running compilation step : cd /tmp/ltsmin15140149543627744228;'/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/ltsmin15140149543627744228;'/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/ltsmin15140149543627744228;'/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-20 00:20:12] [INFO ] Flatten gal took : 61 ms
[2022-05-20 00:20:12] [INFO ] Flatten gal took : 60 ms
[2022-05-20 00:20:12] [INFO ] Time to serialize gal into /tmp/LTL10754803749511123724.gal : 6 ms
[2022-05-20 00:20:12] [INFO ] Time to serialize properties into /tmp/LTL11462446117338451357.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/LTL10754803749511123724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11462446117338451357.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/LTL1075480...268
Read 1 LTL properties
Checking formula 0 : !(((G(X("((p1277==1)&&(p1293==1))")))U(((G("((p1277==1)&&(p1293==1))"))||(F("((p1041==1)&&(p1052==1))")))||("((p1041==1)&&(p1052==1))"...159
Formula 0 simplified : !(GX"((p1277==1)&&(p1293==1))" U ("((p1041==1)&&(p1052==1))" | G"((p1277==1)&&(p1293==1))" | F"((p1041==1)&&(p1052==1))"))
Detected timeout of ITS tools.
[2022-05-20 00:20:27] [INFO ] Flatten gal took : 57 ms
[2022-05-20 00:20:27] [INFO ] Applying decomposition
[2022-05-20 00:20:27] [INFO ] Flatten gal took : 76 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/graph5647498117866973806.txt' '-o' '/tmp/graph5647498117866973806.bin' '-w' '/tmp/graph5647498117866973806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5647498117866973806.bin' '-l' '-1' '-v' '-w' '/tmp/graph5647498117866973806.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:20:27] [INFO ] Decomposing Gal with order
[2022-05-20 00:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:20:27] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:20:27] [INFO ] Flatten gal took : 81 ms
[2022-05-20 00:20:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 80 ms.
[2022-05-20 00:20:28] [INFO ] Time to serialize gal into /tmp/LTL3570301995171906464.gal : 15 ms
[2022-05-20 00:20:28] [INFO ] Time to serialize properties into /tmp/LTL13802469894454219464.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/LTL3570301995171906464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13802469894454219464.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/LTL3570301...246
Read 1 LTL properties
Checking formula 0 : !(((G(X("((i41.i0.u453.p1277==1)&&(i41.i0.u459.p1293==1))")))U(((G("((i41.i0.u453.p1277==1)&&(i41.i0.u459.p1293==1))"))||(F("((i33.i1....255
Formula 0 simplified : !(GX"((i41.i0.u453.p1277==1)&&(i41.i0.u459.p1293==1))" U ("((i33.i1.u370.p1041==1)&&(i33.i1.u373.p1052==1))" | G"((i41.i0.u453.p1277...241
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4536679222776711406
[2022-05-20 00:20:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4536679222776711406
Running compilation step : cd /tmp/ltsmin4536679222776711406;'/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'
Compilation finished in 2778 ms.
Running link step : cd /tmp/ltsmin4536679222776711406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4536679222776711406;'/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))) U ([]((LTLAPp0==true))||<>((LTLAPp1==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-07 finished in 117857 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U (!G(X(p0))&&p1))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 39 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:20:58] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:20:59] [INFO ] Implicit Places using invariants in 831 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:20:59] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:21:00] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2594 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:21:00] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:21:01] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) p0), p0]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1151 1) (EQ s1172 1)), p0:(EQ s1272 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 164 reset in 987 ms.
Product exploration explored 100000 steps with 166 reset in 1168 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p1) p0), p0]
Finished random walk after 597 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) p0), p0]
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:21:04] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:21:06] [INFO ] [Real]Absence check using 551 positive place invariants in 635 ms returned sat
[2022-05-20 00:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:21:13] [INFO ] [Real]Absence check using state equation in 7052 ms returned sat
[2022-05-20 00:21:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:21:15] [INFO ] [Nat]Absence check using 551 positive place invariants in 364 ms returned sat
[2022-05-20 00:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:21:20] [INFO ] [Nat]Absence check using state equation in 5195 ms returned sat
[2022-05-20 00:21:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2022-05-20 00:21:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-20 00:21:20] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 71 ms.
[2022-05-20 00:21:29] [INFO ] Deduced a trap composed of 3 places in 730 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:21:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 32 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:21:29] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:21:30] [INFO ] Implicit Places using invariants in 848 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:21:30] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:21:31] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:21:31] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:21:32] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 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 p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p1) p0), p0]
Finished random walk after 601 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p1) p0), p0]
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:21:33] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:21:35] [INFO ] [Real]Absence check using 551 positive place invariants in 623 ms returned sat
[2022-05-20 00:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:21:42] [INFO ] [Real]Absence check using state equation in 6960 ms returned sat
[2022-05-20 00:21:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:21:44] [INFO ] [Nat]Absence check using 551 positive place invariants in 370 ms returned sat
[2022-05-20 00:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:21:49] [INFO ] [Nat]Absence check using state equation in 5141 ms returned sat
[2022-05-20 00:21:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2022-05-20 00:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-20 00:21:49] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 70 ms.
[2022-05-20 00:21:57] [INFO ] Added : 320 causal constraints over 64 iterations in 8164 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 168 reset in 899 ms.
Product exploration explored 100000 steps with 164 reset in 1081 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) p0), p0]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 94 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2022-05-20 00:21:59] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:21:59] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:22:00] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Product exploration explored 100000 steps with 165 reset in 963 ms.
Product exploration explored 100000 steps with 167 reset in 1111 ms.
Built C files in :
/tmp/ltsmin11194500153177133714
[2022-05-20 00:22:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11194500153177133714
Running compilation step : cd /tmp/ltsmin11194500153177133714;'/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'
Compilation finished in 2477 ms.
Running link step : cd /tmp/ltsmin11194500153177133714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11194500153177133714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8375538265240252723.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 38 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:22:17] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:22:18] [INFO ] Implicit Places using invariants in 830 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:22:18] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:22:20] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2673 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:22:20] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:22:21] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin11878601538490949610
[2022-05-20 00:22:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11878601538490949610
Running compilation step : cd /tmp/ltsmin11878601538490949610;'/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'
Compilation finished in 2557 ms.
Running link step : cd /tmp/ltsmin11878601538490949610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11878601538490949610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8522802119246255441.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 00:22:36] [INFO ] Flatten gal took : 64 ms
[2022-05-20 00:22:36] [INFO ] Flatten gal took : 55 ms
[2022-05-20 00:22:36] [INFO ] Time to serialize gal into /tmp/LTL974259428421287679.gal : 6 ms
[2022-05-20 00:22:36] [INFO ] Time to serialize properties into /tmp/LTL12947977559155017569.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/LTL974259428421287679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12947977559155017569.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/LTL9742594...266
Read 1 LTL properties
Checking formula 0 : !((F((G("(p1272==1)"))U(((!(G(X("(p1272==1)"))))&&("(p1151==1)"))&&("(p1172==1)")))))
Formula 0 simplified : !F(G"(p1272==1)" U ("(p1151==1)" & "(p1172==1)" & !GX"(p1272==1)"))
Detected timeout of ITS tools.
[2022-05-20 00:22:51] [INFO ] Flatten gal took : 54 ms
[2022-05-20 00:22:51] [INFO ] Applying decomposition
[2022-05-20 00:22:51] [INFO ] Flatten gal took : 53 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/graph11472797748929650564.txt' '-o' '/tmp/graph11472797748929650564.bin' '-w' '/tmp/graph11472797748929650564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11472797748929650564.bin' '-l' '-1' '-v' '-w' '/tmp/graph11472797748929650564.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:22:52] [INFO ] Decomposing Gal with order
[2022-05-20 00:22:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:22:52] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:22:52] [INFO ] Flatten gal took : 71 ms
[2022-05-20 00:22:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 86 ms.
[2022-05-20 00:22:52] [INFO ] Time to serialize gal into /tmp/LTL13345685757702309877.gal : 24 ms
[2022-05-20 00:22:52] [INFO ] Time to serialize properties into /tmp/LTL6414251905207833411.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/LTL13345685757702309877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6414251905207833411.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/LTL1334568...246
Read 1 LTL properties
Checking formula 0 : !((F((G("(i40.u451.p1272==1)"))U(((!(G(X("(i40.u451.p1272==1)"))))&&("(i37.u408.p1151==1)"))&&("(i37.u416.p1172==1)")))))
Formula 0 simplified : !F(G"(i40.u451.p1272==1)" U ("(i37.u408.p1151==1)" & "(i37.u416.p1172==1)" & !GX"(i40.u451.p1272==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11438011071438139477
[2022-05-20 00:23:07] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11438011071438139477
Running compilation step : cd /tmp/ltsmin11438011071438139477;'/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'
Compilation finished in 2575 ms.
Running link step : cd /tmp/ltsmin11438011071438139477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11438011071438139477;'/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' '<>(([]((LTLAPp0==true)) U ())&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-08 finished in 144232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(X(X(p0)))))))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1552 transition count 1302
Applied a total of 2 rules in 84 ms. Remains 1552 /1553 variables (removed 1) and now considering 1302/1303 (removed 1) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:23:22] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:23:23] [INFO ] Implicit Places using invariants in 836 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:23:23] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:23:25] [INFO ] Implicit Places using invariants and state equation in 1856 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
[2022-05-20 00:23:25] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1302 rows 1552 cols
[2022-05-20 00:23:25] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:23:26] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/1553 places, 1302/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1552/1553 places, 1302/1303 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1530 1) (EQ s1541 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3212 steps with 0 reset in 40 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-09 finished in 3733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p0 U (G(p1) U !X(p2))) U p3))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:23:26] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:23:27] [INFO ] Implicit Places using invariants in 848 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:23:27] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:23:28] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:23:28] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:23:29] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s1098 1) (EQ s1118 1)), p1:(AND (EQ s229 1) (EQ s231 1)), p0:(AND (EQ s140 1) (EQ s157 1)), p2:(OR (AND (EQ s229 1) (EQ s231 1)) (AND (EQ s109...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22205 reset in 2068 ms.
Product exploration explored 100000 steps with 22250 reset in 2187 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 p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT p3)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 808 ms. Reduced automaton from 8 states, 20 edges and 4 AP to 8 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 408 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:23:35] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:23:35] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 00:23:36] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2022-05-20 00:23:37] [INFO ] After 1259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 00:23:38] [INFO ] After 1877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 243 ms.
[2022-05-20 00:23:38] [INFO ] After 2521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 0 with 446 rules applied. Total rules applied 450 place count 1551 transition count 1301
Applied a total of 450 rules in 119 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Finished probabilistic random walk after 34454 steps, run visited all 1 properties in 436 ms. (steps per millisecond=79 )
Probabilistic random walk after 34454 steps, saw 33871 distinct states, run finished after 438 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT p3)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p3)))]
False Knowledge obtained : [(F p2), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p3), (F (AND p1 p2)), (F p1), (F (AND p0 p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 16 factoid took 1216 ms. Reduced automaton from 8 states, 20 edges and 4 AP to 8 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 299 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 333 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:23:41] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:23:42] [INFO ] [Real]Absence check using 551 positive place invariants in 564 ms returned sat
[2022-05-20 00:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:23:50] [INFO ] [Real]Absence check using state equation in 7268 ms returned sat
[2022-05-20 00:23:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:23:51] [INFO ] [Nat]Absence check using 551 positive place invariants in 405 ms returned sat
[2022-05-20 00:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:23:56] [INFO ] [Nat]Absence check using state equation in 4662 ms returned sat
[2022-05-20 00:23:56] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-20 00:23:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2022-05-20 00:23:56] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2022-05-20 00:23:56] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2022-05-20 00:23:57] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2022-05-20 00:23:57] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-20 00:23:57] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2022-05-20 00:23:57] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2022-05-20 00:23:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-20 00:23:57] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2022-05-20 00:23:57] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2022-05-20 00:23:58] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2022-05-20 00:23:58] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-05-20 00:23:58] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2022-05-20 00:23:58] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-20 00:23:58] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2022-05-20 00:23:58] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 0 ms to minimize.
[2022-05-20 00:23:59] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-05-20 00:23:59] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2022-05-20 00:23:59] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2022-05-20 00:23:59] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2022-05-20 00:23:59] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-20 00:23:59] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2022-05-20 00:24:00] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2022-05-20 00:24:00] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 0 ms to minimize.
[2022-05-20 00:24:00] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 0 ms to minimize.
[2022-05-20 00:24:00] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2022-05-20 00:24:01] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2022-05-20 00:24:01] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-05-20 00:24:01] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 0 ms to minimize.
[2022-05-20 00:24:01] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5116 ms
[2022-05-20 00:24:01] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 62 ms.
[2022-05-20 00:24:05] [INFO ] Added : 120 causal constraints over 24 iterations in 3671 ms. Result :unknown
Could not prove EG (NOT p3)
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 35 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:05] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:24:06] [INFO ] Implicit Places using invariants in 808 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:06] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:24:07] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:07] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 00:24:08] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 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) (NOT p3) (NOT p2)), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p3)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 868 ms. Reduced automaton from 8 states, 20 edges and 4 AP to 8 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 299 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:10] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:24:10] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 00:24:10] [INFO ] [Nat]Absence check using 551 positive place invariants in 92 ms returned sat
[2022-05-20 00:24:11] [INFO ] After 1203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 00:24:12] [INFO ] After 1792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 233 ms.
[2022-05-20 00:24:12] [INFO ] After 2370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 0 with 446 rules applied. Total rules applied 450 place count 1551 transition count 1301
Applied a total of 450 rules in 119 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Finished random walk after 6605 steps, including 1 resets, run visited all 1 properties in 80 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p3)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p3)))]
False Knowledge obtained : [(F p2), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p3), (F (AND p1 p2)), (F p1), (F (AND p0 p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 16 factoid took 1039 ms. Reduced automaton from 8 states, 20 edges and 4 AP to 8 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 276 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 298 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:14] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:24:16] [INFO ] [Real]Absence check using 551 positive place invariants in 541 ms returned sat
[2022-05-20 00:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:24:23] [INFO ] [Real]Absence check using state equation in 6785 ms returned sat
[2022-05-20 00:24:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:24:24] [INFO ] [Nat]Absence check using 551 positive place invariants in 428 ms returned sat
[2022-05-20 00:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:24:29] [INFO ] [Nat]Absence check using state equation in 4949 ms returned sat
[2022-05-20 00:24:29] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2022-05-20 00:24:29] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2022-05-20 00:24:30] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2022-05-20 00:24:30] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2022-05-20 00:24:30] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2022-05-20 00:24:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-20 00:24:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2022-05-20 00:24:30] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2022-05-20 00:24:30] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-05-20 00:24:31] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2022-05-20 00:24:31] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2022-05-20 00:24:31] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-20 00:24:31] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-20 00:24:31] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2022-05-20 00:24:31] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-20 00:24:31] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-20 00:24:32] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2022-05-20 00:24:32] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-05-20 00:24:32] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2022-05-20 00:24:32] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-20 00:24:32] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2022-05-20 00:24:32] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-20 00:24:33] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-05-20 00:24:33] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-20 00:24:33] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2022-05-20 00:24:33] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2022-05-20 00:24:34] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 0 ms to minimize.
[2022-05-20 00:24:34] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2022-05-20 00:24:34] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2022-05-20 00:24:34] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 0 ms to minimize.
[2022-05-20 00:24:34] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5033 ms
[2022-05-20 00:24:34] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 64 ms.
[2022-05-20 00:24:38] [INFO ] Deduced a trap composed of 3 places in 761 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:24:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 345 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
Product exploration explored 100000 steps with 22239 reset in 2100 ms.
Product exploration explored 100000 steps with 22251 reset in 2234 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 307 ms :[(NOT p3), (NOT p3), p2, (NOT p3), p2, p2, true, (NOT p1)]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 85 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2022-05-20 00:24:44] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:44] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:24:44] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Product exploration explored 100000 steps with 22236 reset in 2095 ms.
Product exploration explored 100000 steps with 22231 reset in 2245 ms.
Built C files in :
/tmp/ltsmin15182817821742586112
[2022-05-20 00:24:49] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15182817821742586112
Running compilation step : cd /tmp/ltsmin15182817821742586112;'/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'
Compilation finished in 2570 ms.
Running link step : cd /tmp/ltsmin15182817821742586112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15182817821742586112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14038838398367811274.hoa' '--buchi-type=spotba'
LTSmin run took 3830 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050A-LTLFireability-11 finished in 89615 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&X(G(X(p1)))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 41 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:55] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:24:56] [INFO ] Implicit Places using invariants in 793 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:56] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:24:58] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:58] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:24:59] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (AND (EQ s512 1) (EQ s529 1)) (EQ s1004 0) (EQ s1006 0)), p0:(OR (EQ s1005 0) (EQ s1025 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1202 steps with 0 reset in 17 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-13 finished in 3688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(!F(p0) U p0))))'
Support contains 1 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 39 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:24:59] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:25:00] [INFO ] Implicit Places using invariants in 844 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:25:00] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:25:02] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:25:02] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:25:02] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3506 ms.
Product exploration explored 100000 steps with 50000 reset in 3557 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-050A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-14 finished in 10613 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X(X((G(F(p0)) U p1))))))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 81 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:10] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:25:11] [INFO ] Implicit Places using invariants in 845 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:11] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:25:12] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2679 ms to find 0 implicit places.
[2022-05-20 00:25:12] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:12] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:25:13] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1060 1) (EQ s1077 1)), p0:(EQ s430 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 28632 steps with 11 reset in 298 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-15 finished in 4087 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (G(p0)||F(p1)||p1)))'
Found a SL insensitive property : ShieldPPPs-PT-050A-LTLFireability-07
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 82 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:14] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:25:15] [INFO ] Implicit Places using invariants in 780 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:15] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:25:16] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:17] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:25:17] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1041 1) (EQ s1052 1)), p0:(AND (EQ s1277 1) (EQ s1293 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 125 reset in 946 ms.
Product exploration explored 100000 steps with 131 reset in 1114 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Finished random walk after 804 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:20] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:25:22] [INFO ] [Real]Absence check using 551 positive place invariants in 646 ms returned sat
[2022-05-20 00:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:25:30] [INFO ] [Real]Absence check using state equation in 7958 ms returned sat
[2022-05-20 00:25:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:25:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 468 ms returned sat
[2022-05-20 00:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:25:37] [INFO ] [Nat]Absence check using state equation in 5392 ms returned sat
[2022-05-20 00:25:37] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 70 ms.
[2022-05-20 00:25:45] [INFO ] Added : 285 causal constraints over 57 iterations in 7928 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 47 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:45] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:25:46] [INFO ] Implicit Places using invariants in 828 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:46] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:25:48] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2618 ms to find 0 implicit places.
[2022-05-20 00:25:48] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:48] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:25:48] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 791 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=98 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:25:49] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:25:51] [INFO ] [Real]Absence check using 551 positive place invariants in 615 ms returned sat
[2022-05-20 00:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:25:59] [INFO ] [Real]Absence check using state equation in 7956 ms returned sat
[2022-05-20 00:25:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:26:00] [INFO ] [Nat]Absence check using 551 positive place invariants in 442 ms returned sat
[2022-05-20 00:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:26:06] [INFO ] [Nat]Absence check using state equation in 5326 ms returned sat
[2022-05-20 00:26:06] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 64 ms.
[2022-05-20 00:26:14] [INFO ] Added : 290 causal constraints over 58 iterations in 8032 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Product exploration explored 100000 steps with 127 reset in 981 ms.
Product exploration explored 100000 steps with 125 reset in 1122 ms.
Built C files in :
/tmp/ltsmin6067206298919219070
[2022-05-20 00:26:16] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2022-05-20 00:26:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:26:16] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2022-05-20 00:26:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:26:16] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2022-05-20 00:26:16] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:26:16] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6067206298919219070
Running compilation step : cd /tmp/ltsmin6067206298919219070;'/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/ltsmin6067206298919219070;'/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/ltsmin6067206298919219070;'/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 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 48 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:26:19] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:26:20] [INFO ] Implicit Places using invariants in 852 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:26:20] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:26:22] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
[2022-05-20 00:26:22] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:26:22] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:26:22] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin4711082708717474956
[2022-05-20 00:26:22] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2022-05-20 00:26:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:26:22] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2022-05-20 00:26:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:26:23] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2022-05-20 00:26:23] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:26:23] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4711082708717474956
Running compilation step : cd /tmp/ltsmin4711082708717474956;'/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/ltsmin4711082708717474956;'/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/ltsmin4711082708717474956;'/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-20 00:26:26] [INFO ] Flatten gal took : 55 ms
[2022-05-20 00:26:26] [INFO ] Flatten gal took : 54 ms
[2022-05-20 00:26:26] [INFO ] Time to serialize gal into /tmp/LTL15039301914242625471.gal : 9 ms
[2022-05-20 00:26:26] [INFO ] Time to serialize properties into /tmp/LTL5578871571636801711.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/LTL15039301914242625471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5578871571636801711.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/LTL1503930...267
Read 1 LTL properties
Checking formula 0 : !(((G(X("((p1277==1)&&(p1293==1))")))U(((G("((p1277==1)&&(p1293==1))"))||(F("((p1041==1)&&(p1052==1))")))||("((p1041==1)&&(p1052==1))"...159
Formula 0 simplified : !(GX"((p1277==1)&&(p1293==1))" U ("((p1041==1)&&(p1052==1))" | G"((p1277==1)&&(p1293==1))" | F"((p1041==1)&&(p1052==1))"))
Detected timeout of ITS tools.
[2022-05-20 00:26:41] [INFO ] Flatten gal took : 53 ms
[2022-05-20 00:26:41] [INFO ] Applying decomposition
[2022-05-20 00:26:41] [INFO ] Flatten gal took : 53 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/graph12704543436994763009.txt' '-o' '/tmp/graph12704543436994763009.bin' '-w' '/tmp/graph12704543436994763009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12704543436994763009.bin' '-l' '-1' '-v' '-w' '/tmp/graph12704543436994763009.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:26:41] [INFO ] Decomposing Gal with order
[2022-05-20 00:26:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:26:41] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:26:41] [INFO ] Flatten gal took : 66 ms
[2022-05-20 00:26:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 42 ms.
[2022-05-20 00:26:41] [INFO ] Time to serialize gal into /tmp/LTL19814145427229416.gal : 13 ms
[2022-05-20 00:26:41] [INFO ] Time to serialize properties into /tmp/LTL17271566765376652717.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/LTL19814145427229416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17271566765376652717.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/LTL1981414...244
Read 1 LTL properties
Checking formula 0 : !(((G(X("((i41.i1.u453.p1277==1)&&(i41.i1.u459.p1293==1))")))U(((G("((i41.i1.u453.p1277==1)&&(i41.i1.u459.p1293==1))"))||(F("((i33.i2....255
Formula 0 simplified : !(GX"((i41.i1.u453.p1277==1)&&(i41.i1.u459.p1293==1))" U ("((i33.i2.u370.p1041==1)&&(i33.i2.u373.p1052==1))" | G"((i41.i1.u453.p1277...241
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14784013739342240657
[2022-05-20 00:26:56] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14784013739342240657
Running compilation step : cd /tmp/ltsmin14784013739342240657;'/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'
Compilation finished in 2509 ms.
Running link step : cd /tmp/ltsmin14784013739342240657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14784013739342240657;'/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))) U ([]((LTLAPp0==true))||<>((LTLAPp1==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-07 finished in 117608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U (!G(X(p0))&&p1))))'
Found a CL insensitive property : ShieldPPPs-PT-050A-LTLFireability-08
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) p0), p0]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 87 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:12] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:27:12] [INFO ] Implicit Places using invariants in 840 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:12] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:27:14] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:14] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:27:15] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1151 1) (EQ s1172 1)), p0:(EQ s1272 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 171 reset in 915 ms.
Product exploration explored 100000 steps with 172 reset in 1084 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) p0), p0]
Finished random walk after 565 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) p0), p0]
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:18] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:27:19] [INFO ] [Real]Absence check using 551 positive place invariants in 602 ms returned sat
[2022-05-20 00:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:27:27] [INFO ] [Real]Absence check using state equation in 7230 ms returned sat
[2022-05-20 00:27:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:27:28] [INFO ] [Nat]Absence check using 551 positive place invariants in 373 ms returned sat
[2022-05-20 00:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:27:34] [INFO ] [Nat]Absence check using state equation in 5806 ms returned sat
[2022-05-20 00:27:34] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 67 ms.
[2022-05-20 00:27:42] [INFO ] Added : 275 causal constraints over 55 iterations in 7646 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 39 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:42] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:27:43] [INFO ] Implicit Places using invariants in 835 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:43] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:27:44] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:44] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:27:45] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 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 p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) p0), p0]
Finished random walk after 544 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) p0), p0]
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:27:46] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:27:48] [INFO ] [Real]Absence check using 551 positive place invariants in 625 ms returned sat
[2022-05-20 00:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:27:55] [INFO ] [Real]Absence check using state equation in 7107 ms returned sat
[2022-05-20 00:27:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:27:56] [INFO ] [Nat]Absence check using 551 positive place invariants in 353 ms returned sat
[2022-05-20 00:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:28:02] [INFO ] [Nat]Absence check using state equation in 5786 ms returned sat
[2022-05-20 00:28:02] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 72 ms.
[2022-05-20 00:28:11] [INFO ] Deduced a trap composed of 3 places in 746 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:28:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 168 reset in 980 ms.
Product exploration explored 100000 steps with 170 reset in 1166 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) p0), p0]
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 48 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2022-05-20 00:28:13] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:28:13] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:28:14] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Product exploration explored 100000 steps with 170 reset in 970 ms.
Product exploration explored 100000 steps with 168 reset in 1121 ms.
Built C files in :
/tmp/ltsmin16881231031984772067
[2022-05-20 00:28:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16881231031984772067
Running compilation step : cd /tmp/ltsmin16881231031984772067;'/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'
Compilation finished in 2477 ms.
Running link step : cd /tmp/ltsmin16881231031984772067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16881231031984772067;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12176067065194466891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 39 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:28:31] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:28:32] [INFO ] Implicit Places using invariants in 816 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:28:32] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:28:34] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2536 ms to find 0 implicit places.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:28:34] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:28:34] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin12167405355124167300
[2022-05-20 00:28:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12167405355124167300
Running compilation step : cd /tmp/ltsmin12167405355124167300;'/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'
Compilation finished in 2376 ms.
Running link step : cd /tmp/ltsmin12167405355124167300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12167405355124167300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11023616240888513350.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 00:28:50] [INFO ] Flatten gal took : 54 ms
[2022-05-20 00:28:50] [INFO ] Flatten gal took : 52 ms
[2022-05-20 00:28:50] [INFO ] Time to serialize gal into /tmp/LTL13915233195685442357.gal : 4 ms
[2022-05-20 00:28:50] [INFO ] Time to serialize properties into /tmp/LTL17128986613798299387.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/LTL13915233195685442357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17128986613798299387.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/LTL1391523...268
Read 1 LTL properties
Checking formula 0 : !((F((G("(p1272==1)"))U(((!(G(X("(p1272==1)"))))&&("(p1151==1)"))&&("(p1172==1)")))))
Formula 0 simplified : !F(G"(p1272==1)" U ("(p1151==1)" & "(p1172==1)" & !GX"(p1272==1)"))
Detected timeout of ITS tools.
[2022-05-20 00:29:05] [INFO ] Flatten gal took : 52 ms
[2022-05-20 00:29:05] [INFO ] Applying decomposition
[2022-05-20 00:29:05] [INFO ] Flatten gal took : 55 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/graph14775698437834908663.txt' '-o' '/tmp/graph14775698437834908663.bin' '-w' '/tmp/graph14775698437834908663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14775698437834908663.bin' '-l' '-1' '-v' '-w' '/tmp/graph14775698437834908663.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:29:05] [INFO ] Decomposing Gal with order
[2022-05-20 00:29:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:29:05] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:29:05] [INFO ] Flatten gal took : 67 ms
[2022-05-20 00:29:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 52 ms.
[2022-05-20 00:29:05] [INFO ] Time to serialize gal into /tmp/LTL15145083940841016273.gal : 11 ms
[2022-05-20 00:29:05] [INFO ] Time to serialize properties into /tmp/LTL15102276539732541187.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/LTL15145083940841016273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15102276539732541187.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/LTL1514508...247
Read 1 LTL properties
Checking formula 0 : !((F((G("(i40.i3.u451.p1272==1)"))U(((!(G(X("(i40.i3.u451.p1272==1)"))))&&("(i37.i2.u408.p1151==1)"))&&("(i37.i2.u416.p1172==1)")))))
Formula 0 simplified : !F(G"(i40.i3.u451.p1272==1)" U ("(i37.i2.u408.p1151==1)" & "(i37.i2.u416.p1172==1)" & !GX"(i40.i3.u451.p1272==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3329722077959050517
[2022-05-20 00:29:20] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3329722077959050517
Running compilation step : cd /tmp/ltsmin3329722077959050517;'/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'
Compilation finished in 2351 ms.
Running link step : cd /tmp/ltsmin3329722077959050517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3329722077959050517;'/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' '<>(([]((LTLAPp0==true)) U ())&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-08 finished in 144095 ms.
[2022-05-20 00:29:35] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12898498519172942892
[2022-05-20 00:29:35] [INFO ] Computing symmetric may disable matrix : 1303 transitions.
[2022-05-20 00:29:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:29:35] [INFO ] Computing symmetric may enable matrix : 1303 transitions.
[2022-05-20 00:29:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:29:35] [INFO ] Applying decomposition
[2022-05-20 00:29:36] [INFO ] Flatten gal took : 51 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/graph17072367089465792764.txt' '-o' '/tmp/graph17072367089465792764.bin' '-w' '/tmp/graph17072367089465792764.weights'
[2022-05-20 00:29:36] [INFO ] Computing Do-Not-Accords matrix : 1303 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17072367089465792764.bin' '-l' '-1' '-v' '-w' '/tmp/graph17072367089465792764.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:29:36] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:29:36] [INFO ] Decomposing Gal with order
[2022-05-20 00:29:36] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12898498519172942892
Running compilation step : cd /tmp/ltsmin12898498519172942892;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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-20 00:29:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:29:36] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:29:36] [INFO ] Flatten gal took : 100 ms
[2022-05-20 00:29:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 87 ms.
[2022-05-20 00:29:36] [INFO ] Time to serialize gal into /tmp/LTLFireability8776807191723930404.gal : 24 ms
[2022-05-20 00:29:36] [INFO ] Time to serialize properties into /tmp/LTLFireability1112949363719292579.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/LTLFireability8776807191723930404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1112949363719292579.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/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !(((G(X("((i41.u453.p1277==1)&&(i41.u459.p1293==1))")))U(((G("((i41.u453.p1277==1)&&(i41.u459.p1293==1))"))||(F("((i33.u370.p1041==1)&...231
Formula 0 simplified : !(GX"((i41.u453.p1277==1)&&(i41.u459.p1293==1))" U ("((i33.u370.p1041==1)&&(i33.u373.p1052==1))" | G"((i41.u453.p1277==1)&&(i41.u459...217
Compilation finished in 4382 ms.
Running link step : cd /tmp/ltsmin12898498519172942892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin12898498519172942892;'/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))) U ([]((LTLAPp0==true))||<>((LTLAPp1==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 00:54:10] [INFO ] Applying decomposition
[2022-05-20 00:54:11] [INFO ] Flatten gal took : 456 ms
[2022-05-20 00:54:11] [INFO ] Decomposing Gal with order
[2022-05-20 00:54:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:54:12] [INFO ] Removed a total of 450 redundant transitions.
[2022-05-20 00:54:12] [INFO ] Flatten gal took : 592 ms
[2022-05-20 00:54:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 396 ms.
[2022-05-20 00:54:12] [INFO ] Time to serialize gal into /tmp/LTLFireability7301803449067147541.gal : 69 ms
[2022-05-20 00:54:12] [INFO ] Time to serialize properties into /tmp/LTLFireability18326633583627539511.ltl : 3 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/LTLFireability7301803449067147541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18326633583627539511.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/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !(((G(X("((i330.u578.p1277==1)&&(u586.p1293==1))")))U(((G("((i330.u578.p1277==1)&&(u586.p1293==1))"))||(F("((i268.u473.p1041==1)&&(u47...219
Formula 0 simplified : !(GX"((i330.u578.p1277==1)&&(u586.p1293==1))" U ("((i268.u473.p1041==1)&&(u476.p1052==1))" | G"((i330.u578.p1277==1)&&(u586.p1293==1...205
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12898498519172942892;'/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))) U ([]((LTLAPp0==true))||<>((LTLAPp1==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12898498519172942892;'/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' '<>(([]((LTLAPp2==true)) U ())&&(LTLAPp3==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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldPPPs-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025300500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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