Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762000868.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000868
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 20:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 652K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717272323063

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:05:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:05:24] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-06-01 20:05:24] [INFO ] Transformed 1403 places.
[2024-06-01 20:05:24] [INFO ] Transformed 1903 transitions.
[2024-06-01 20:05:24] [INFO ] Found NUPN structural information;
[2024-06-01 20:05:24] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-100A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 165 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:05:24] [INFO ] Computed 401 invariants in 35 ms
[2024-06-01 20:05:25] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-06-01 20:05:25] [INFO ] Invariant cache hit.
[2024-06-01 20:05:27] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2744 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:05:27] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30076 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30032 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61259ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61293ms
Finished structural reductions in LTL mode , in 1 iterations and 64232 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Support contains 75 out of 1403 places after structural reductions.
[2024-06-01 20:06:29] [INFO ] Flatten gal took : 285 ms
[2024-06-01 20:06:29] [INFO ] Flatten gal took : 129 ms
[2024-06-01 20:06:29] [INFO ] Input system was already deterministic with 1903 transitions.
Support contains 69 out of 1403 places (down from 75) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (28 resets) in 2265 ms. (17 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 584 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 2/2 properties
[2024-06-01 20:06:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 31/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1362/1403 variables, 391/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1362/1804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:31] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 25 ms to minimize.
[2024-06-01 20:06:31] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 4 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:06:32] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:06:33] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 20/1824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:34] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:06:35] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 5058ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 200 times.
Drop transitions (Partial Free agglomeration) removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 202 place count 1402 transition count 1902
Applied a total of 202 rules in 464 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 1402/1403 places, 1902/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 776 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 201460 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 201460 steps, saw 199640 distinct states, run finished after 3005 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:06:40] [INFO ] Computed 401 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 31/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1361/1402 variables, 391/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1361/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 6 ms to minimize.
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 5 ms to minimize.
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:06:41] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:06:42] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:06:43] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:06:44] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 6 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:06:45] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 20/1843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 1/1844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:47] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 4 ms to minimize.
[2024-06-01 20:06:47] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:06:47] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:06:48] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:06:48] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:06:48] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 4 ms to minimize.
[2024-06-01 20:06:48] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:06:49] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:06:49] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:06:49] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:06:49] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:06:49] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:06:50] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 13/3259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 0/3259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3304 variables, 0/3259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3259 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10645 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 31/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1361/1402 variables, 391/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1361/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 54/1857 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:51] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:06:51] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:06:51] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:06:51] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:06:51] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:06:51] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:06:52] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 20/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:06:53] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:06:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 8/1885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 2/3289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:06:55] [INFO ] Deduced a trap composed of 7 places in 348 ms of which 5 ms to minimize.
[2024-06-01 20:06:56] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 5 ms to minimize.
[2024-06-01 20:06:56] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 5 ms to minimize.
[2024-06-01 20:06:56] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 5 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 4 ms to minimize.
[2024-06-01 20:06:57] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 5 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 4 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 4 ms to minimize.
[2024-06-01 20:06:58] [INFO ] Deduced a trap composed of 11 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:06:59] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:06:59] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 5 ms to minimize.
[2024-06-01 20:07:00] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:07:00] [INFO ] Deduced a trap composed of 11 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:07:00] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:07:01] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 5 ms to minimize.
[2024-06-01 20:07:01] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:07:01] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 5 ms to minimize.
[2024-06-01 20:07:02] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:07:02] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:07:03] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:07:03] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 4 ms to minimize.
[2024-06-01 20:07:03] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 3 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 4 ms to minimize.
[2024-06-01 20:07:04] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:07:05] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:07:06] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 6 ms to minimize.
[2024-06-01 20:07:06] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 5 ms to minimize.
[2024-06-01 20:07:06] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 3 ms to minimize.
[2024-06-01 20:07:07] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:07:08] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:07:09] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:07:10] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:07:10] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:07:10] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 3 ms to minimize.
[2024-06-01 20:07:11] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 4 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:07:12] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 3 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:07:13] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 4 ms to minimize.
[2024-06-01 20:07:14] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:07:14] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:07:14] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:07:15] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:07:15] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:07:15] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:07:15] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:07:16] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:07:16] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:07:16] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:07:17] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:07:17] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:07:17] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:07:18] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:07:18] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:07:18] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:07:18] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:07:19] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:07:19] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 3 ms to minimize.
[2024-06-01 20:07:19] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:07:20] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:07:20] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 4 ms to minimize.
[2024-06-01 20:07:20] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 4 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 4 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:07:21] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 20/3369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:07:22] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 4 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:07:23] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 4 ms to minimize.
[2024-06-01 20:07:24] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:07:24] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 3 ms to minimize.
[2024-06-01 20:07:24] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:07:25] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:07:25] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:07:25] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:07:25] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:07:26] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 4 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:07:27] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 20/3389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:07:28] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:07:29] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:07:29] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:07:29] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 4 ms to minimize.
[2024-06-01 20:07:29] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:07:30] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:07:30] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:07:30] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:07:31] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:07:31] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:07:31] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:07:32] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:07:32] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 3 ms to minimize.
[2024-06-01 20:07:32] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:07:32] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:07:33] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3304 variables, 20/3409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:07:34] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 4 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:07:35] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 3 ms to minimize.
SMT process timed out in 55843ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2299 ms.
Support contains 10 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 82 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 57 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-06-01 20:07:38] [INFO ] Invariant cache hit.
[2024-06-01 20:07:39] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-06-01 20:07:39] [INFO ] Invariant cache hit.
[2024-06-01 20:07:41] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2732 ms to find 0 implicit places.
[2024-06-01 20:07:41] [INFO ] Redundant transitions in 555 ms returned []
Running 1901 sub problems to find dead transitions.
[2024-06-01 20:07:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30028 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30030 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61080ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 61099ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64457 ms. Remains : 1402/1402 places, 1902/1902 transitions.
FORMULA ShieldRVs-PT-100A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((p1 U p2) U G(p3))))'
Support contains 9 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 135 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:08:43] [INFO ] Computed 401 invariants in 11 ms
[2024-06-01 20:08:43] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-06-01 20:08:43] [INFO ] Invariant cache hit.
[2024-06-01 20:08:45] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2024-06-01 20:08:45] [INFO ] Redundant transitions in 377 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:08:45] [INFO ] Computed 401 invariants in 11 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
timeout
(s66 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30032 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30032 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60903ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60920ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 69 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63793 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p0) (NOT p3)), true, (NOT p0), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 990 steps with 0 reset in 17 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-00 finished in 64329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 113 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-06-01 20:09:47] [INFO ] Computed 401 invariants in 7 ms
[2024-06-01 20:09:48] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-06-01 20:09:48] [INFO ] Invariant cache hit.
[2024-06-01 20:09:49] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2024-06-01 20:09:50] [INFO ] Redundant transitions in 776 ms returned [599]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-06-01 20:09:50] [INFO ] Computed 401 invariants in 10 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30663ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 50 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33775 ms. Remains : 1401/1403 places, 1900/1903 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-01
Product exploration explored 100000 steps with 181 reset in 918 ms.
Product exploration explored 100000 steps with 180 reset in 1076 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 2417 steps (0 resets) in 67 ms. (35 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (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 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 20:10:23] [INFO ] Invariant cache hit.
[2024-06-01 20:10:25] [INFO ] [Real]Absence check using 401 positive place invariants in 210 ms returned sat
[2024-06-01 20:10:28] [INFO ] [Real]Absence check using state equation in 2767 ms returned sat
[2024-06-01 20:10:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:10:29] [INFO ] [Nat]Absence check using 401 positive place invariants in 171 ms returned sat
[2024-06-01 20:10:31] [INFO ] [Nat]Absence check using state equation in 2322 ms returned sat
[2024-06-01 20:10:31] [INFO ] Computed and/alt/rep : 1702/7383/1702 causal constraints (skipped 197 transitions) in 118 ms.
[2024-06-01 20:10:43] [INFO ] Added : 525 causal constraints over 105 iterations in 11353 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-06-01 20:10:43] [INFO ] Invariant cache hit.
[2024-06-01 20:10:44] [INFO ] [Real]Absence check using 401 positive place invariants in 209 ms returned sat
[2024-06-01 20:10:47] [INFO ] [Real]Absence check using state equation in 2569 ms returned sat
[2024-06-01 20:10:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:10:48] [INFO ] [Nat]Absence check using 401 positive place invariants in 168 ms returned sat
[2024-06-01 20:10:50] [INFO ] [Nat]Absence check using state equation in 2586 ms returned sat
[2024-06-01 20:10:51] [INFO ] Computed and/alt/rep : 1702/7383/1702 causal constraints (skipped 197 transitions) in 109 ms.
[2024-06-01 20:11:02] [INFO ] Added : 540 causal constraints over 108 iterations in 11135 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 44 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:11:02] [INFO ] Invariant cache hit.
[2024-06-01 20:11:02] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-06-01 20:11:02] [INFO ] Invariant cache hit.
[2024-06-01 20:11:04] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2200 ms to find 0 implicit places.
[2024-06-01 20:11:04] [INFO ] Redundant transitions in 299 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:11:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30712ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30733ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33290 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 2322 steps (0 resets) in 44 ms. (51 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (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 154 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 20:11:36] [INFO ] Invariant cache hit.
[2024-06-01 20:11:37] [INFO ] [Real]Absence check using 401 positive place invariants in 200 ms returned sat
[2024-06-01 20:11:40] [INFO ] [Real]Absence check using state equation in 2848 ms returned sat
[2024-06-01 20:11:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:11:41] [INFO ] [Nat]Absence check using 401 positive place invariants in 167 ms returned sat
[2024-06-01 20:11:43] [INFO ] [Nat]Absence check using state equation in 2378 ms returned sat
[2024-06-01 20:11:44] [INFO ] Computed and/alt/rep : 1702/7383/1702 causal constraints (skipped 197 transitions) in 120 ms.
Could not prove EG (NOT p0)
[2024-06-01 20:11:55] [INFO ] Invariant cache hit.
[2024-06-01 20:11:56] [INFO ] [Real]Absence check using 401 positive place invariants in 198 ms returned sat
[2024-06-01 20:11:59] [INFO ] [Real]Absence check using state equation in 2442 ms returned sat
[2024-06-01 20:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:12:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 168 ms returned sat
[2024-06-01 20:12:03] [INFO ] [Nat]Absence check using state equation in 2747 ms returned sat
[2024-06-01 20:12:03] [INFO ] Computed and/alt/rep : 1702/7383/1702 causal constraints (skipped 197 transitions) in 107 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 20:12:14] [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 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 180 reset in 789 ms.
Product exploration explored 100000 steps with 180 reset in 956 ms.
Support contains 2 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 53 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:12:16] [INFO ] Invariant cache hit.
[2024-06-01 20:12:16] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-06-01 20:12:16] [INFO ] Invariant cache hit.
[2024-06-01 20:12:18] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
[2024-06-01 20:12:18] [INFO ] Redundant transitions in 347 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:12:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30751ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33597 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Treatment of property ShieldRVs-PT-100A-LTLFireability-01 finished in 182482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(!p1) U p2)))))'
Support contains 7 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 83 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:12:49] [INFO ] Computed 401 invariants in 10 ms
[2024-06-01 20:12:50] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-06-01 20:12:50] [INFO ] Invariant cache hit.
[2024-06-01 20:12:52] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
[2024-06-01 20:12:52] [INFO ] Redundant transitions in 354 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:12:52] [INFO ] Computed 401 invariants in 8 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30030 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30037 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60947ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 46 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63886 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-03
Stuttering criterion allowed to conclude after 1340 steps with 0 reset in 14 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-03 finished in 64072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 31 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:13:53] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:13:54] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-06-01 20:13:54] [INFO ] Invariant cache hit.
[2024-06-01 20:13:56] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30035 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60950ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60972ms
Finished structural reductions in LTL mode , in 1 iterations and 63245 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 5025 ms.
Product exploration explored 100000 steps with 50000 reset in 5180 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100A-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100A-LTLFireability-05 finished in 73591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 83 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:15:07] [INFO ] Computed 401 invariants in 12 ms
[2024-06-01 20:15:08] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 20:15:08] [INFO ] Invariant cache hit.
[2024-06-01 20:15:09] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2024-06-01 20:15:10] [INFO ] Redundant transitions in 320 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:15:10] [INFO ] Computed 401 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30035 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60972ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60992ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 46 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63800 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-06
Product exploration explored 100000 steps with 3878 reset in 1134 ms.
Product exploration explored 100000 steps with 3862 reset in 1310 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 : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 89 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-06-01 20:16:14] [INFO ] Invariant cache hit.
[2024-06-01 20:16:15] [INFO ] [Real]Absence check using 401 positive place invariants in 261 ms returned sat
[2024-06-01 20:16:18] [INFO ] [Real]Absence check using state equation in 2992 ms returned sat
[2024-06-01 20:16:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:16:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 236 ms returned sat
[2024-06-01 20:16:23] [INFO ] [Nat]Absence check using state equation in 2955 ms returned sat
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1459 ms
[2024-06-01 20:16:24] [INFO ] Computed and/alt/rep : 909/3359/909 causal constraints (skipped 991 transitions) in 108 ms.
Could not prove EG (NOT p0)
Support contains 5 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 48 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:16:33] [INFO ] Invariant cache hit.
[2024-06-01 20:16:34] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-06-01 20:16:34] [INFO ] Invariant cache hit.
[2024-06-01 20:16:35] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
[2024-06-01 20:16:36] [INFO ] Redundant transitions in 313 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:16:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30037 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30027 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60962ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60980ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63588 ms. Remains : 1402/1402 places, 1901/1901 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 107 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-06-01 20:17:37] [INFO ] Invariant cache hit.
[2024-06-01 20:17:39] [INFO ] [Real]Absence check using 401 positive place invariants in 268 ms returned sat
[2024-06-01 20:17:42] [INFO ] [Real]Absence check using state equation in 2925 ms returned sat
[2024-06-01 20:17:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:17:43] [INFO ] [Nat]Absence check using 401 positive place invariants in 239 ms returned sat
[2024-06-01 20:17:46] [INFO ] [Nat]Absence check using state equation in 2927 ms returned sat
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
[2024-06-01 20:17:46] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 4 ms to minimize.
[2024-06-01 20:17:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1435 ms
[2024-06-01 20:17:48] [INFO ] Computed and/alt/rep : 909/3359/909 causal constraints (skipped 991 transitions) in 95 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 20:17:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3895 reset in 1102 ms.
Product exploration explored 100000 steps with 3897 reset in 1266 ms.
Support contains 5 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 43 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:17:59] [INFO ] Invariant cache hit.
[2024-06-01 20:18:00] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-01 20:18:00] [INFO ] Invariant cache hit.
[2024-06-01 20:18:01] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2024-06-01 20:18:02] [INFO ] Redundant transitions in 317 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:18:02] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30030 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30027 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60834ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60851ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63402 ms. Remains : 1402/1402 places, 1901/1901 transitions.
Treatment of property ShieldRVs-PT-100A-LTLFireability-06 finished in 235572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 86 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-06-01 20:19:03] [INFO ] Computed 401 invariants in 10 ms
[2024-06-01 20:19:03] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-06-01 20:19:03] [INFO ] Invariant cache hit.
[2024-06-01 20:19:05] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2024-06-01 20:19:05] [INFO ] Redundant transitions in 316 ms returned [599]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-06-01 20:19:05] [INFO ] Computed 401 invariants in 5 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30679ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 41 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33310 ms. Remains : 1401/1403 places, 1900/1903 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-07
Stuttering criterion allowed to conclude after 1342 steps with 0 reset in 15 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-07 finished in 33449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p1)&&p0) U (G(p2) U X(p3))))'
Support contains 7 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 38 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:19:36] [INFO ] Computed 401 invariants in 10 ms
[2024-06-01 20:19:37] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 20:19:37] [INFO ] Invariant cache hit.
[2024-06-01 20:19:39] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2430 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:19:39] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30035 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30034 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61005ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61027ms
Finished structural reductions in LTL mode , in 1 iterations and 63501 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p2), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-08 finished in 63820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((G(p2)||p1)))&&p0)))'
Support contains 7 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 34 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2024-06-01 20:20:40] [INFO ] Invariant cache hit.
[2024-06-01 20:20:41] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-06-01 20:20:41] [INFO ] Invariant cache hit.
[2024-06-01 20:20:42] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:20:42] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s35 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30032 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60853ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60872ms
Finished structural reductions in LTL mode , in 1 iterations and 63159 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-09 finished in 63332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 87 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:21:43] [INFO ] Computed 401 invariants in 7 ms
[2024-06-01 20:21:44] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-06-01 20:21:44] [INFO ] Invariant cache hit.
[2024-06-01 20:21:46] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
[2024-06-01 20:21:46] [INFO ] Redundant transitions in 328 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:21:46] [INFO ] Computed 401 invariants in 6 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30034 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30029 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60877ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60898ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 42 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63650 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-10
Stuttering criterion allowed to conclude after 1300 steps with 0 reset in 16 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-10 finished in 63813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 77 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2024-06-01 20:22:47] [INFO ] Computed 401 invariants in 8 ms
[2024-06-01 20:22:48] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 20:22:48] [INFO ] Invariant cache hit.
[2024-06-01 20:22:49] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
[2024-06-01 20:22:50] [INFO ] Redundant transitions in 315 ms returned [600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1900 sub problems to find dead transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2024-06-01 20:22:50] [INFO ] Computed 401 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30033 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30025 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60856ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60876ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/1403 places, 1901/1903 transitions.
Applied a total of 0 rules in 40 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63534 ms. Remains : 1402/1403 places, 1901/1903 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-11
Product exploration explored 100000 steps with 77 reset in 753 ms.
Product exploration explored 100000 steps with 77 reset in 937 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20271 steps (12 resets) in 203 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 45 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:23:53] [INFO ] Invariant cache hit.
[2024-06-01 20:23:54] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-06-01 20:23:54] [INFO ] Invariant cache hit.
[2024-06-01 20:23:55] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2213 ms to find 0 implicit places.
[2024-06-01 20:23:55] [INFO ] Redundant transitions in 303 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:23:56] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30031 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30033 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60870ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60887ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63458 ms. Remains : 1402/1402 places, 1901/1901 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33686 steps (23 resets) in 322 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 77 reset in 769 ms.
Product exploration explored 100000 steps with 76 reset in 923 ms.
Support contains 3 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1402/1402 places, 1901/1901 transitions.
Applied a total of 0 rules in 39 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 20:24:59] [INFO ] Invariant cache hit.
[2024-06-01 20:24:59] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 20:24:59] [INFO ] Invariant cache hit.
[2024-06-01 20:25:01] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2024-06-01 20:25:01] [INFO ] Redundant transitions in 308 ms returned []
Running 1900 sub problems to find dead transitions.
[2024-06-01 20:25:01] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30027 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3303 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30028 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 0/0 constraints]
After SMT, in 60891ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60909ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63547 ms. Remains : 1402/1402 places, 1901/1901 transitions.
Treatment of property ShieldRVs-PT-100A-LTLFireability-11 finished in 195277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 79 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-06-01 20:26:02] [INFO ] Computed 401 invariants in 7 ms
[2024-06-01 20:26:03] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-06-01 20:26:03] [INFO ] Invariant cache hit.
[2024-06-01 20:26:05] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
[2024-06-01 20:26:05] [INFO ] Redundant transitions in 315 ms returned [599]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-06-01 20:26:05] [INFO ] Computed 401 invariants in 6 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30697ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30715ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 43 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33350 ms. Remains : 1401/1403 places, 1900/1903 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-12
Product exploration explored 100000 steps with 76 reset in 750 ms.
Product exploration explored 100000 steps with 75 reset in 914 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 25648 steps (17 resets) in 301 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 1 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 42 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:26:38] [INFO ] Invariant cache hit.
[2024-06-01 20:26:39] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-06-01 20:26:39] [INFO ] Invariant cache hit.
[2024-06-01 20:26:40] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
[2024-06-01 20:26:40] [INFO ] Redundant transitions in 310 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30657ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30674ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33156 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 13866 steps (8 resets) in 131 ms. (105 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 76 reset in 754 ms.
Product exploration explored 100000 steps with 76 reset in 922 ms.
Support contains 1 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 40 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-06-01 20:27:13] [INFO ] Invariant cache hit.
[2024-06-01 20:27:14] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-06-01 20:27:14] [INFO ] Invariant cache hit.
[2024-06-01 20:27:15] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2024-06-01 20:27:16] [INFO ] Redundant transitions in 322 ms returned []
Running 1899 sub problems to find dead transitions.
[2024-06-01 20:27:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30707ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30726ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33321 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Treatment of property ShieldRVs-PT-100A-LTLFireability-12 finished in 104214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||G(p1)) U (p2&&F(p3)))))'
Support contains 8 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 30 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:27:47] [INFO ] Computed 401 invariants in 7 ms
[2024-06-01 20:27:47] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-01 20:27:47] [INFO ] Invariant cache hit.
[2024-06-01 20:27:49] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:27:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30027 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30038 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61023ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 61040ms
Finished structural reductions in LTL mode , in 1 iterations and 63292 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-13
Stuttering criterion allowed to conclude after 1338 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-13 finished in 63501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 79 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2024-06-01 20:28:50] [INFO ] Computed 401 invariants in 9 ms
[2024-06-01 20:28:51] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-06-01 20:28:51] [INFO ] Invariant cache hit.
[2024-06-01 20:28:52] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
[2024-06-01 20:28:53] [INFO ] Redundant transitions in 333 ms returned [599]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2024-06-01 20:28:53] [INFO ] Computed 401 invariants in 7 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
SMT process timed out in 30679ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 30696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/1403 places, 1900/1903 transitions.
Applied a total of 0 rules in 62 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33332 ms. Remains : 1401/1403 places, 1900/1903 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 395 steps with 0 reset in 6 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-14 finished in 33446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(p1)&&G(p2)))||p0))))'
Support contains 9 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 37 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2024-06-01 20:29:24] [INFO ] Computed 401 invariants in 7 ms
[2024-06-01 20:29:24] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-06-01 20:29:24] [INFO ] Invariant cache hit.
[2024-06-01 20:29:26] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2024-06-01 20:29:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 1402/1402 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3306 variables, and 1402 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30027 ms.
Refiners :[Domain max(s): 1402/1403 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints]
After SMT, in 60887ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60906ms
Finished structural reductions in LTL mode , in 1 iterations and 63221 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-100A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 553 steps with 0 reset in 7 ms.
FORMULA ShieldRVs-PT-100A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100A-LTLFireability-15 finished in 63495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 20:30:28] [INFO ] Flatten gal took : 94 ms
[2024-06-01 20:30:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 20:30:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1403 places, 1903 transitions and 9200 arcs took 16 ms.
Total runtime 1503870 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-100A, 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 r528-tall-171683762000868"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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