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.r488-tall-171631133100620.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 DoubleLock-PT-p2s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133100620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 12 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 813K May 18 16:42 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 DoubleLock-PT-p2s2-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717202345184

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:39:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:39:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:39:06] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-06-01 00:39:06] [INFO ] Transformed 184 places.
[2024-06-01 00:39:06] [INFO ] Transformed 1832 transitions.
[2024-06-01 00:39:06] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 144 transition count 1768
Applied a total of 4 rules in 34 ms. Remains 144 /148 variables (removed 4) and now considering 1768/1768 (removed 0) transitions.
[2024-06-01 00:39:06] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 144 cols
[2024-06-01 00:39:06] [INFO ] Computed 2 invariants in 37 ms
[2024-06-01 00:39:07] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 00:39:07] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2024-06-01 00:39:07] [INFO ] Invariant cache hit.
[2024-06-01 00:39:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:39:07] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 1766 sub problems to find dead transitions.
[2024-06-01 00:39:07] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2024-06-01 00:39:07] [INFO ] Invariant cache hit.
[2024-06-01 00:39:07] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 3 (OVERLAPS) 1225/1369 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1369 variables, 116/262 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 262 constraints, problems are : Problem set: 0 solved, 1766 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1766/1766 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1766 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 3 (OVERLAPS) 1225/1369 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1369 variables, 116/262 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1369 variables, 1766/2028 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 2028 constraints, problems are : Problem set: 0 solved, 1766 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1766/1766 constraints, Known Traps: 0/0 constraints]
After SMT, in 62717ms problems are : Problem set: 0 solved, 1766 unsolved
Search for dead transitions found 0 dead transitions in 62752ms
Starting structural reductions in LTL mode, iteration 1 : 144/148 places, 1768/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63962 ms. Remains : 144/148 places, 1768/1768 transitions.
Support contains 51 out of 144 places after structural reductions.
[2024-06-01 00:40:10] [INFO ] Flatten gal took : 127 ms
[2024-06-01 00:40:10] [INFO ] Flatten gal took : 86 ms
[2024-06-01 00:40:11] [INFO ] Input system was already deterministic with 1768 transitions.
RANDOM walk for 40006 steps (407 resets) in 1629 ms. (24 steps per ms) remains 14/27 properties
BEST_FIRST walk for 40003 steps (80 resets) in 238 ms. (167 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (69 resets) in 157 ms. (253 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (75 resets) in 82 ms. (481 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (84 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (75 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (70 resets) in 137 ms. (289 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (74 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (69 resets) in 58 ms. (678 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (70 resets) in 43 ms. (909 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (70 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (71 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (81 resets) in 38 ms. (1025 steps per ms) remains 9/10 properties
[2024-06-01 00:40:12] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2024-06-01 00:40:12] [INFO ] Invariant cache hit.
[2024-06-01 00:40:12] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 39/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 766/824 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 516/1340 variables, 57/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1340 variables, 104/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1340 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 10 (OVERLAPS) 29/1369 variables, 29/262 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1369 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 262 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 41/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 701/757 variables, 56/57 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/757 variables, 12/69 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 582/1339 variables, 58/127 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1339 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1339 variables, 104/232 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1339 variables, 8/240 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1339 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 11 (OVERLAPS) 30/1369 variables, 30/270 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1369 variables, 0/270 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1369 variables, 0/270 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 270 constraints, problems are : Problem set: 6 solved, 3 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2981ms problems are : Problem set: 6 solved, 3 unsolved
Parikh walk visited 0 properties in 1021 ms.
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 144 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 143 transition count 1707
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 143 transition count 1707
Applied a total of 31 rules in 84 ms. Remains 143 /144 variables (removed 1) and now considering 1707/1768 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 143/144 places, 1707/1768 transitions.
RANDOM walk for 40016 steps (404 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (73 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (72 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (66 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 313927 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 3
Probabilistic random walk after 313927 steps, saw 214893 distinct states, run finished after 3004 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-01 00:40:19] [INFO ] Flow matrix only has 1164 transitions (discarded 543 similar events)
// Phase 1: matrix 1164 rows 143 cols
[2024-06-01 00:40:19] [INFO ] Computed 2 invariants in 9 ms
[2024-06-01 00:40:19] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 669/724 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/724 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/724 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 553/1277 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1277 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1277 variables, 104/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1277 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 30/1307 variables, 30/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1307 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1307 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1307/1307 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 669/724 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/724 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/724 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 553/1277 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1277 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1277 variables, 104/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1277 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1277 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 30/1307 variables, 30/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1307 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1307 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1307/1307 variables, and 264 constraints, problems are : Problem set: 0 solved, 3 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1315ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 395 ms.
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1707/1707 transitions.
Applied a total of 0 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 143/143 places, 1707/1707 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1707/1707 transitions.
Applied a total of 0 rules in 32 ms. Remains 143 /143 variables (removed 0) and now considering 1707/1707 (removed 0) transitions.
[2024-06-01 00:40:21] [INFO ] Flow matrix only has 1164 transitions (discarded 543 similar events)
[2024-06-01 00:40:21] [INFO ] Invariant cache hit.
[2024-06-01 00:40:21] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 00:40:21] [INFO ] Flow matrix only has 1164 transitions (discarded 543 similar events)
[2024-06-01 00:40:21] [INFO ] Invariant cache hit.
[2024-06-01 00:40:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:40:22] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2024-06-01 00:40:22] [INFO ] Redundant transitions in 127 ms returned []
Running 1705 sub problems to find dead transitions.
[2024-06-01 00:40:22] [INFO ] Flow matrix only has 1164 transitions (discarded 543 similar events)
[2024-06-01 00:40:22] [INFO ] Invariant cache hit.
[2024-06-01 00:40:22] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 3 (OVERLAPS) 1164/1307 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1307 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1307/1307 variables, and 261 constraints, problems are : Problem set: 0 solved, 1705 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1705/1705 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 3 (OVERLAPS) 1164/1307 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1307 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1307 variables, 1705/1966 constraints. Problems are: Problem set: 0 solved, 1705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1307/1307 variables, and 1966 constraints, problems are : Problem set: 0 solved, 1705 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1705/1705 constraints, Known Traps: 0/0 constraints]
After SMT, in 62331ms problems are : Problem set: 0 solved, 1705 unsolved
Search for dead transitions found 0 dead transitions in 62347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63402 ms. Remains : 143/143 places, 1707/1707 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 543 transitions.
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 143 transition count 1164
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 543 place count 143 transition count 1156
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 559 place count 135 transition count 1156
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 565 place count 132 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 566 place count 131 transition count 1121
Iterating global reduction 1 with 1 rules applied. Total rules applied 567 place count 131 transition count 1121
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 568 place count 131 transition count 1120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 569 place count 130 transition count 1120
Applied a total of 569 rules in 67 ms. Remains 130 /143 variables (removed 13) and now considering 1120/1707 (removed 587) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1120 rows 130 cols
[2024-06-01 00:41:24] [INFO ] Computed 2 invariants in 12 ms
[2024-06-01 00:41:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:41:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:41:24] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 00:41:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 00:41:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:41:25] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 00:41:25] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 00:41:25] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 981 ms.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA DoubleLock-PT-p2s2-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 416 stable transitions
FORMULA DoubleLock-PT-p2s2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(p0)) U p1)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 79 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:41:25] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
// Phase 1: matrix 1193 rows 143 cols
[2024-06-01 00:41:25] [INFO ] Computed 2 invariants in 13 ms
[2024-06-01 00:41:26] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 00:41:26] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:41:26] [INFO ] Invariant cache hit.
[2024-06-01 00:41:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:41:26] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-06-01 00:41:26] [INFO ] Redundant transitions in 33 ms returned []
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:41:26] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:41:26] [INFO ] Invariant cache hit.
[2024-06-01 00:41:26] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1175 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 18 solved, 1716 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 18 solved, 1716 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62385ms problems are : Problem set: 18 solved, 1716 unsolved
Search for dead transitions found 18 dead transitions in 62408ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1718/1768 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1718/1718 (removed 0) transitions.
[2024-06-01 00:42:29] [INFO ] Redundant transitions in 84 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63451 ms. Remains : 143/144 places, 1718/1768 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-01
Stuttering criterion allowed to conclude after 48797 steps with 782 reset in 295 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-01 finished in 64017 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||G(p1))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 36 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:42:29] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:42:29] [INFO ] Invariant cache hit.
[2024-06-01 00:42:29] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 00:42:29] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:42:29] [INFO ] Invariant cache hit.
[2024-06-01 00:42:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:42:30] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2024-06-01 00:42:30] [INFO ] Redundant transitions in 26 ms returned []
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:42:30] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:42:30] [INFO ] Invariant cache hit.
[2024-06-01 00:42:30] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 14 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 14 solved, 1720 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62407ms problems are : Problem set: 14 solved, 1720 unsolved
Search for dead transitions found 14 dead transitions in 62422ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1722/1768 transitions.
Applied a total of 0 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-06-01 00:43:33] [INFO ] Redundant transitions in 23 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63290 ms. Remains : 143/144 places, 1722/1768 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-02
Product exploration explored 100000 steps with 1991 reset in 397 ms.
Product exploration explored 100000 steps with 1995 reset in 417 ms.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 2517 steps (23 resets) in 14 ms. (167 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 1722/1722 transitions.
Applied a total of 0 rules in 32 ms. Remains 143 /143 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-06-01 00:43:34] [INFO ] Flow matrix only has 1181 transitions (discarded 541 similar events)
// Phase 1: matrix 1181 rows 143 cols
[2024-06-01 00:43:34] [INFO ] Computed 2 invariants in 6 ms
[2024-06-01 00:43:34] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 00:43:34] [INFO ] Flow matrix only has 1181 transitions (discarded 541 similar events)
[2024-06-01 00:43:34] [INFO ] Invariant cache hit.
[2024-06-01 00:43:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:43:35] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2024-06-01 00:43:35] [INFO ] Redundant transitions in 29 ms returned []
Running 1720 sub problems to find dead transitions.
[2024-06-01 00:43:35] [INFO ] Flow matrix only has 1181 transitions (discarded 541 similar events)
[2024-06-01 00:43:35] [INFO ] Invariant cache hit.
[2024-06-01 00:43:35] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 3 (OVERLAPS) 1181/1324 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1324 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1720 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 Real declared 1324/1324 variables, and 261 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1720/1720 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 3 (OVERLAPS) 1181/1324 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1324 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1324 variables, 1720/1981 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1981 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1720/1720 constraints, Known Traps: 0/0 constraints]
After SMT, in 62282ms problems are : Problem set: 0 solved, 1720 unsolved
Search for dead transitions found 0 dead transitions in 62309ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63349 ms. Remains : 143/143 places, 1722/1722 transitions.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 4040 steps (43 resets) in 19 ms. (202 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1972 reset in 315 ms.
Product exploration explored 100000 steps with 2035 reset in 321 ms.
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 1722/1722 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-06-01 00:44:38] [INFO ] Flow matrix only has 1181 transitions (discarded 541 similar events)
[2024-06-01 00:44:38] [INFO ] Invariant cache hit.
[2024-06-01 00:44:39] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 00:44:39] [INFO ] Flow matrix only has 1181 transitions (discarded 541 similar events)
[2024-06-01 00:44:39] [INFO ] Invariant cache hit.
[2024-06-01 00:44:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:44:39] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2024-06-01 00:44:39] [INFO ] Redundant transitions in 27 ms returned []
Running 1720 sub problems to find dead transitions.
[2024-06-01 00:44:39] [INFO ] Flow matrix only has 1181 transitions (discarded 541 similar events)
[2024-06-01 00:44:39] [INFO ] Invariant cache hit.
[2024-06-01 00:44:39] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 3 (OVERLAPS) 1181/1324 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1324 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 261 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1720/1720 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 3 (OVERLAPS) 1181/1324 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1324 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1324 variables, 1720/1981 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1981 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1720/1720 constraints, Known Traps: 0/0 constraints]
After SMT, in 62206ms problems are : Problem set: 0 solved, 1720 unsolved
Search for dead transitions found 0 dead transitions in 62221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63244 ms. Remains : 143/143 places, 1722/1722 transitions.
Treatment of property DoubleLock-PT-p2s2-LTLFireability-02 finished in 192538 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)&&F(!(((F(p1)||p2) U p3) U p2))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 8 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:45:42] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
// Phase 1: matrix 1193 rows 143 cols
[2024-06-01 00:45:42] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 00:45:42] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 00:45:42] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:45:42] [INFO ] Invariant cache hit.
[2024-06-01 00:45:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:45:43] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:45:43] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:45:43] [INFO ] Invariant cache hit.
[2024-06-01 00:45:43] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1175 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 18 solved, 1716 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 18 solved, 1716 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62210ms problems are : Problem set: 18 solved, 1716 unsolved
Search for dead transitions found 18 dead transitions in 62226ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1718/1768 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 1718/1718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62970 ms. Remains : 143/144 places, 1718/1768 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) p2), (NOT p0), p2, (AND p2 p3 p1), (AND p2 p3), true, (AND p1 p2)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-03
Entered a terminal (fully accepting) state of product in 90 steps with 1 reset in 2 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-03 finished in 63289 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 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 36 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:46:45] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:46:45] [INFO ] Invariant cache hit.
[2024-06-01 00:46:45] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 00:46:45] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:46:45] [INFO ] Invariant cache hit.
[2024-06-01 00:46:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:46:46] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2024-06-01 00:46:46] [INFO ] Redundant transitions in 23 ms returned []
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:46:46] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:46:46] [INFO ] Invariant cache hit.
[2024-06-01 00:46:46] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 14 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 14 solved, 1720 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62486ms problems are : Problem set: 14 solved, 1720 unsolved
Search for dead transitions found 14 dead transitions in 62501ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1722/1768 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-06-01 00:47:48] [INFO ] Redundant transitions in 23 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63332 ms. Remains : 143/144 places, 1722/1768 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-04
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-04 finished in 63400 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(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 8 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:47:49] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:47:49] [INFO ] Invariant cache hit.
[2024-06-01 00:47:49] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 00:47:49] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:47:49] [INFO ] Invariant cache hit.
[2024-06-01 00:47:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:47:49] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:47:49] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:47:49] [INFO ] Invariant cache hit.
[2024-06-01 00:47:49] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 10 solved, 1724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 10 solved, 1724 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62365ms problems are : Problem set: 10 solved, 1724 unsolved
Search for dead transitions found 10 dead transitions in 62380ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1726/1768 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 1726/1726 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63155 ms. Remains : 143/144 places, 1726/1768 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-05 finished in 63263 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(G(p0))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 6 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:48:52] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:48:52] [INFO ] Invariant cache hit.
[2024-06-01 00:48:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 00:48:52] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:48:52] [INFO ] Invariant cache hit.
[2024-06-01 00:48:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:48:53] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:48:53] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:48:53] [INFO ] Invariant cache hit.
[2024-06-01 00:48:53] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 10 solved, 1724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 10 solved, 1724 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62450ms problems are : Problem set: 10 solved, 1724 unsolved
Search for dead transitions found 10 dead transitions in 62466ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1726/1768 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 1726/1726 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63249 ms. Remains : 143/144 places, 1726/1768 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-07 finished in 63398 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((X(X(p0))||G((!(!p0 U p1)||!p0)))))'
Support contains 0 out of 144 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 28 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:49:55] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:49:55] [INFO ] Invariant cache hit.
[2024-06-01 00:49:55] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 00:49:55] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:49:55] [INFO ] Invariant cache hit.
[2024-06-01 00:49:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:49:56] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-06-01 00:49:56] [INFO ] Redundant transitions in 23 ms returned []
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:49:56] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:49:56] [INFO ] Invariant cache hit.
[2024-06-01 00:49:56] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 10 solved, 1724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 10 solved, 1724 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62328ms problems are : Problem set: 10 solved, 1724 unsolved
Search for dead transitions found 10 dead transitions in 62342ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1726/1768 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1726/1726 (removed 0) transitions.
[2024-06-01 00:50:58] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63165 ms. Remains : 143/144 places, 1726/1768 transitions.
Stuttering acceptance computed with spot in 10 ms :[false]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-08
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-08 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-08 finished in 63192 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(F(p0))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 8 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:50:58] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:50:58] [INFO ] Invariant cache hit.
[2024-06-01 00:50:58] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 00:50:58] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:50:58] [INFO ] Invariant cache hit.
[2024-06-01 00:50:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:50:59] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:50:59] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:50:59] [INFO ] Invariant cache hit.
[2024-06-01 00:50:59] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 14 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 14 solved, 1720 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62368ms problems are : Problem set: 14 solved, 1720 unsolved
Search for dead transitions found 14 dead transitions in 62385ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1722/1768 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63141 ms. Remains : 143/144 places, 1722/1768 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-09
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-09 finished in 63278 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&&(p1||F(!p2)||G(F(!p3)))&&(p1||X(F(!p3)))))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 28 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:52:02] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:52:02] [INFO ] Invariant cache hit.
[2024-06-01 00:52:02] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 00:52:02] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:52:02] [INFO ] Invariant cache hit.
[2024-06-01 00:52:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:52:02] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-06-01 00:52:02] [INFO ] Redundant transitions in 28 ms returned []
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:52:02] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:52:02] [INFO ] Invariant cache hit.
[2024-06-01 00:52:02] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 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 Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 4 solved, 1730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 4 solved, 1730 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62249ms problems are : Problem set: 4 solved, 1730 unsolved
Search for dead transitions found 4 dead transitions in 62263ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1732/1768 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2024-06-01 00:53:05] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63119 ms. Remains : 143/144 places, 1732/1768 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3))]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-11
Product exploration explored 100000 steps with 33355 reset in 210 ms.
Product exploration explored 100000 steps with 33405 reset in 220 ms.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X (NOT p3)), (X (AND (NOT p1) p0)), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) p3)))), (X (NOT (AND p1 p0 p3))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (AND (NOT p1) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3))]
RANDOM walk for 40007 steps (408 resets) in 185 ms. (215 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (80 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2024-06-01 00:53:06] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
// Phase 1: matrix 1189 rows 143 cols
[2024-06-01 00:53:06] [INFO ] Computed 2 invariants in 6 ms
[2024-06-01 00:53:06] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 993/1059 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 18/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1059 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 273/1332 variables, 77/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1332 variables, 98/261 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1332 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1332 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1332/1332 variables, and 261 constraints, problems are : Problem set: 1 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 584/635 variables, 51/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 12/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 641/1276 variables, 45/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1276 variables, 38/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1276 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1276 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/1332 variables, 47/195 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1332 variables, 1/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1332 variables, 66/262 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1332 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1332 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 262 constraints, problems are : Problem set: 1 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1732/1732 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 143 transition count 1700
Applied a total of 32 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1732 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1700/1732 transitions.
RANDOM walk for 40008 steps (407 resets) in 82 ms. (482 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (73 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 560908 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 560908 steps, saw 380163 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-06-01 00:53:10] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
// Phase 1: matrix 1157 rows 143 cols
[2024-06-01 00:53:10] [INFO ] Computed 3 invariants in 12 ms
[2024-06-01 00:53:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1255 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1255 variables, 44/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1255 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1300 variables, 28/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 72/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1300 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1255 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1255 variables, 44/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1255 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/1300 variables, 28/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 72/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1300 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1300 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 143/143 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-06-01 00:53:11] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
[2024-06-01 00:53:11] [INFO ] Invariant cache hit.
[2024-06-01 00:53:11] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 00:53:11] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
[2024-06-01 00:53:11] [INFO ] Invariant cache hit.
[2024-06-01 00:53:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:53:11] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2024-06-01 00:53:11] [INFO ] Redundant transitions in 27 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-06-01 00:53:11] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
[2024-06-01 00:53:11] [INFO ] Invariant cache hit.
[2024-06-01 00:53:11] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
[2024-06-01 00:53:25] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 8 ms to minimize.
Problem TDEAD1100 is UNSAT
[2024-06-01 00:53:25] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
[2024-06-01 00:53:25] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 1 ms to minimize.
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1124 is UNSAT
[2024-06-01 00:53:25] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1148 is UNSAT
[2024-06-01 00:53:25] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 1 ms to minimize.
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 5/8 constraints. Problems are: Problem set: 164 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 164 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1157/1300 variables, 143/151 constraints. Problems are: Problem set: 164 solved, 1534 unsolved
SMT process timed out in 32217ms, After SMT, problems are : Problem set: 164 solved, 1534 unsolved
Search for dead transitions found 164 dead transitions in 32232ms
Found 164 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 164 transitions
Dead transitions reduction (with SMT) removed 164 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:53:44] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33189 ms. Remains : 143/143 places, 1536/1700 transitions.
RANDOM walk for 40002 steps (404 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 601510 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 601510 steps, saw 407331 distinct states, run finished after 3002 ms. (steps per millisecond=200 ) properties seen :0
[2024-06-01 00:53:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2024-06-01 00:53:47] [INFO ] Computed 3 invariants in 11 ms
[2024-06-01 00:53:47] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1004/1119 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1119 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1164 variables, 28/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1004/1119 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1119 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/1164 variables, 28/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:53:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:53:47] [INFO ] Invariant cache hit.
[2024-06-01 00:53:48] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 00:53:48] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:53:48] [INFO ] Invariant cache hit.
[2024-06-01 00:53:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:53:48] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-06-01 00:53:48] [INFO ] Redundant transitions in 22 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-06-01 00:53:48] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:53:48] [INFO ] Invariant cache hit.
[2024-06-01 00:53:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62056ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62863 ms. Remains : 143/143 places, 1536/1536 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X (NOT p3)), (X (AND (NOT p1) p0)), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) p3)))), (X (NOT (AND p1 p0 p3))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p3) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 (NOT p3)) (OR (NOT p3) p1)))), (F p1), (F p3), (F (NOT (OR (NOT p0) (NOT p3) p1)))]
Knowledge based reduction with 14 factoid took 244 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) p3), p3]
Support contains 4 out of 143 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 1732/1732 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2024-06-01 00:54:51] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
// Phase 1: matrix 1189 rows 143 cols
[2024-06-01 00:54:51] [INFO ] Computed 2 invariants in 9 ms
[2024-06-01 00:54:51] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 00:54:51] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
[2024-06-01 00:54:51] [INFO ] Invariant cache hit.
[2024-06-01 00:54:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:54:51] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-06-01 00:54:51] [INFO ] Redundant transitions in 24 ms returned []
Running 1730 sub problems to find dead transitions.
[2024-06-01 00:54:52] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
[2024-06-01 00:54:52] [INFO ] Invariant cache hit.
[2024-06-01 00:54:52] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 3 (OVERLAPS) 1189/1332 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1332 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1332/1332 variables, and 261 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1730/1730 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 3 (OVERLAPS) 1189/1332 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1332 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1332 variables, 1730/1991 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 1991 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1730/1730 constraints, Known Traps: 0/0 constraints]
After SMT, in 62392ms problems are : Problem set: 0 solved, 1730 unsolved
Search for dead transitions found 0 dead transitions in 62407ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63241 ms. Remains : 143/143 places, 1732/1732 transitions.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X p0), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) p3), p3]
RANDOM walk for 40009 steps (408 resets) in 165 ms. (241 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-06-01 00:55:54] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
[2024-06-01 00:55:54] [INFO ] Invariant cache hit.
[2024-06-01 00:55:54] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 584/635 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 641/1276 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1276 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/1332 variables, 47/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1332 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1332 variables, 66/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1332 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1332 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1332/1332 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 584/635 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 641/1276 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1276 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1276 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1276 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/1332 variables, 47/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1332 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1332 variables, 66/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1332 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1332 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 924ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1732/1732 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 143 transition count 1700
Applied a total of 32 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1732 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1700/1732 transitions.
RANDOM walk for 40007 steps (404 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (71 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519870 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519870 steps, saw 352700 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-06-01 00:55:58] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
// Phase 1: matrix 1157 rows 143 cols
[2024-06-01 00:55:58] [INFO ] Computed 3 invariants in 13 ms
[2024-06-01 00:55:58] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1255 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1255 variables, 44/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1255 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1300 variables, 28/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 72/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1300 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1255 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1255 variables, 44/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1255 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/1300 variables, 28/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 72/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1300 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1300 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 640ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1700/1700 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-06-01 00:55:59] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
[2024-06-01 00:55:59] [INFO ] Invariant cache hit.
[2024-06-01 00:55:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 00:55:59] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
[2024-06-01 00:55:59] [INFO ] Invariant cache hit.
[2024-06-01 00:55:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:56:00] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-06-01 00:56:00] [INFO ] Redundant transitions in 28 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-06-01 00:56:00] [INFO ] Flow matrix only has 1157 transitions (discarded 543 similar events)
[2024-06-01 00:56:00] [INFO ] Invariant cache hit.
[2024-06-01 00:56:00] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
[2024-06-01 00:56:12] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 1 ms to minimize.
Problem TDEAD1100 is UNSAT
[2024-06-01 00:56:12] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
[2024-06-01 00:56:13] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 1 ms to minimize.
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1124 is UNSAT
[2024-06-01 00:56:13] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1148 is UNSAT
[2024-06-01 00:56:13] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 1 ms to minimize.
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 5/8 constraints. Problems are: Problem set: 164 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 164 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1157/1300 variables, 143/151 constraints. Problems are: Problem set: 164 solved, 1534 unsolved
SMT process timed out in 32277ms, After SMT, problems are : Problem set: 164 solved, 1534 unsolved
Search for dead transitions found 164 dead transitions in 32291ms
Found 164 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 164 transitions
Dead transitions reduction (with SMT) removed 164 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1700 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:56:32] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33250 ms. Remains : 143/143 places, 1536/1700 transitions.
RANDOM walk for 40005 steps (404 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (79 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 608902 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 608902 steps, saw 412281 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-06-01 00:56:35] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2024-06-01 00:56:35] [INFO ] Computed 3 invariants in 11 ms
[2024-06-01 00:56:35] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1004/1119 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1119 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1164 variables, 28/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1004/1119 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1119 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/1164 variables, 28/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:56:36] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:56:36] [INFO ] Invariant cache hit.
[2024-06-01 00:56:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 00:56:36] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:56:36] [INFO ] Invariant cache hit.
[2024-06-01 00:56:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:56:37] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-06-01 00:56:37] [INFO ] Redundant transitions in 22 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-06-01 00:56:37] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:56:37] [INFO ] Invariant cache hit.
[2024-06-01 00:56:37] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62107ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62923 ms. Remains : 143/143 places, 1536/1536 transitions.
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X p0), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X p0))]
False Knowledge obtained : [(F p3), (F (NOT (OR (NOT p3) (NOT p0))))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) p3), p3]
Product exploration explored 100000 steps with 1583 reset in 312 ms.
Product exploration explored 100000 steps with 1617 reset in 343 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 1732/1732 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2024-06-01 00:57:40] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
// Phase 1: matrix 1189 rows 143 cols
[2024-06-01 00:57:40] [INFO ] Computed 2 invariants in 10 ms
[2024-06-01 00:57:40] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 00:57:40] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
[2024-06-01 00:57:40] [INFO ] Invariant cache hit.
[2024-06-01 00:57:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:57:41] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-06-01 00:57:41] [INFO ] Redundant transitions in 25 ms returned []
Running 1730 sub problems to find dead transitions.
[2024-06-01 00:57:41] [INFO ] Flow matrix only has 1189 transitions (discarded 543 similar events)
[2024-06-01 00:57:41] [INFO ] Invariant cache hit.
[2024-06-01 00:57:41] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 3 (OVERLAPS) 1189/1332 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1332 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1332/1332 variables, and 261 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1730/1730 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 3 (OVERLAPS) 1189/1332 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1332 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1332 variables, 1730/1991 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 1991 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1730/1730 constraints, Known Traps: 0/0 constraints]
After SMT, in 62441ms problems are : Problem set: 0 solved, 1730 unsolved
Search for dead transitions found 0 dead transitions in 62456ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63335 ms. Remains : 143/143 places, 1732/1732 transitions.
Treatment of property DoubleLock-PT-p2s2-LTLFireability-11 finished in 401670 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))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 28 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2024-06-01 00:58:43] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
// Phase 1: matrix 1193 rows 143 cols
[2024-06-01 00:58:43] [INFO ] Computed 2 invariants in 9 ms
[2024-06-01 00:58:43] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 00:58:43] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:58:43] [INFO ] Invariant cache hit.
[2024-06-01 00:58:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:58:44] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2024-06-01 00:58:44] [INFO ] Redundant transitions in 28 ms returned []
Running 1734 sub problems to find dead transitions.
[2024-06-01 00:58:44] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2024-06-01 00:58:44] [INFO ] Invariant cache hit.
[2024-06-01 00:58:44] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 261 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 1734/1995 constraints. Problems are: Problem set: 8 solved, 1726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 8 solved, 1726 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 62355ms problems are : Problem set: 8 solved, 1726 unsolved
Search for dead transitions found 8 dead transitions in 62370ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1728/1768 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 00:59:47] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63275 ms. Remains : 143/144 places, 1728/1768 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, p0]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-15
Entered a terminal (fully accepting) state of product in 6583 steps with 107 reset in 25 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-15 finished in 63379 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||G(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' '!(F(G((p0&&(p1||F(!p2)||G(F(!p3)))&&(p1||X(F(!p3)))))))'
[2024-06-01 00:59:47] [INFO ] Flatten gal took : 64 ms
[2024-06-01 00:59:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 00:59:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 1768 transitions and 7040 arcs took 13 ms.
Total runtime 1241339 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DoubleLock-PT-p2s2-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleLock-PT-p2s2-LTLFireability-11

BK_STOP 1717203601800

--------------------
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
ltl formula name DoubleLock-PT-p2s2-LTLFireability-02
ltl formula formula --ltl=/tmp/1283/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 144 places, 1768 transitions and 7040 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.040 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1283/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1283/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1283/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1283/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 145 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 145, there are 1792 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~100!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 45
pnml2lts-mc( 0/ 4): unique states count: 452
pnml2lts-mc( 0/ 4): unique transitions count: 11193
pnml2lts-mc( 0/ 4): - self-loop count: 252
pnml2lts-mc( 0/ 4): - claim dead count: 207
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 461
pnml2lts-mc( 0/ 4): - cum. max stack depth: 416
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 461 states 11437 transitions, fanout: 24.809
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23050, Transitions per second: 571850
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 28.7 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1798 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p2s2-LTLFireability-11
ltl formula formula --ltl=/tmp/1283/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 144 places, 1768 transitions and 7040 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.050 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1283/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1283/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1283/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1283/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 145 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 145, there are 1792 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1251 levels ~10000 states ~105076 transitions
pnml2lts-mc( 1/ 4): ~2501 levels ~20000 states ~210028 transitions
pnml2lts-mc( 1/ 4): ~5001 levels ~40000 states ~420076 transitions
pnml2lts-mc( 1/ 4): ~10001 levels ~80000 states ~840028 transitions
pnml2lts-mc( 1/ 4): ~20001 levels ~160000 states ~1680076 transitions
pnml2lts-mc( 0/ 4): ~32749 levels ~320000 states ~2475032 transitions
pnml2lts-mc( 0/ 4): ~65476 levels ~640000 states ~4947656 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 370553
pnml2lts-mc( 0/ 4): unique states count: 707343
pnml2lts-mc( 0/ 4): unique transitions count: 9243727
pnml2lts-mc( 0/ 4): - self-loop count: 33764
pnml2lts-mc( 0/ 4): - claim dead count: 917897
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 707492
pnml2lts-mc( 0/ 4): - cum. max stack depth: 336866
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 707492 states 9245293 transitions, fanout: 13.068
pnml2lts-mc( 0/ 4): Total exploration time 13.260 sec (13.000 sec minimum, 13.167 sec on average)
pnml2lts-mc( 0/ 4): States per second: 53355, Transitions per second: 697232
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 89.1MB, 28.4 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1798 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 89.1MB (~256.0MB paged-in)

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="DoubleLock-PT-p2s2"
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 DoubleLock-PT-p2s2, 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 r488-tall-171631133100620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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