Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762401028.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 ShieldRVt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762401028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 02:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 01:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 136K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717277746163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:35:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:35:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:35:47] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-01 21:35:47] [INFO ] Transformed 403 places.
[2024-06-01 21:35:47] [INFO ] Transformed 403 transitions.
[2024-06-01 21:35:47] [INFO ] Found NUPN structural information;
[2024-06-01 21:35:47] [INFO ] Parsed PT model containing 403 places and 403 transitions and 1706 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-050A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 47 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-06-01 21:35:47] [INFO ] Computed 201 invariants in 26 ms
[2024-06-01 21:35:48] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 21:35:48] [INFO ] Invariant cache hit.
[2024-06-01 21:35:48] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:35:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 21764 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 24113 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 46062ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 46088ms
Finished structural reductions in LTL mode , in 1 iterations and 46972 ms. Remains : 403/403 places, 402/402 transitions.
Support contains 60 out of 403 places after structural reductions.
[2024-06-01 21:36:34] [INFO ] Flatten gal took : 79 ms
[2024-06-01 21:36:34] [INFO ] Flatten gal took : 36 ms
[2024-06-01 21:36:34] [INFO ] Input system was already deterministic with 402 transitions.
Support contains 58 out of 403 places (down from 60) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 30
RANDOM walk for 40000 steps (8 resets) in 2069 ms. (19 steps per ms) remains 22/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
[2024-06-01 21:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 42/85 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 42/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 318/403 variables, 159/286 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 318/604 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1453 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 42/85 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 42/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 318/403 variables, 159/286 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 318/604 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 22/1029 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/805 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 0/805 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1029 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1575 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 3048ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 2944 ms.
Support contains 43 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 41 place count 402 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 80 place count 402 transition count 362
Applied a total of 80 rules in 83 ms. Remains 402 /403 variables (removed 1) and now considering 362/402 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 402/403 places, 362/402 transitions.
RANDOM walk for 40000 steps (8 resets) in 655 ms. (60 steps per ms) remains 16/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
// Phase 1: matrix 362 rows 402 cols
[2024-06-01 21:36:42] [INFO ] Computed 201 invariants in 3 ms
[2024-06-01 21:36:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 30/61 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 341/402 variables, 171/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 341/603 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 362/764 variables, 402/1005 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 2/1007 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/764 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 1007 constraints, problems are : Problem set: 0 solved, 16 unsolved in 964 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 402/402 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 30/61 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 341/402 variables, 171/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 341/603 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 362/764 variables, 402/1005 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 2/1007 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 16/1023 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/764 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 1023 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1149 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 402/402 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 2128ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 1837 ms.
Support contains 31 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 362/362 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 402 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 402 transition count 358
Applied a total of 8 rules in 43 ms. Remains 402 /402 variables (removed 0) and now considering 358/362 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 402/402 places, 358/362 transitions.
RANDOM walk for 40000 steps (8 resets) in 458 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
Finished probabilistic random walk after 21171 steps, run visited all 16 properties in 280 ms. (steps per millisecond=75 )
Probabilistic random walk after 21171 steps, saw 20604 distinct states, run finished after 284 ms. (steps per millisecond=74 ) properties seen :16
FORMULA ShieldRVt-PT-050A-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 23 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-06-01 21:36:47] [INFO ] Computed 201 invariants in 2 ms
[2024-06-01 21:36:47] [INFO ] Implicit Places using invariants in 166 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 570 ms.
Product exploration explored 100000 steps with 0 reset in 606 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 34987 steps, run visited all 4 properties in 236 ms. (steps per millisecond=148 )
Probabilistic random walk after 34987 steps, saw 34043 distinct states, run finished after 237 ms. (steps per millisecond=147 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 179 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 18 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-06-01 21:36:49] [INFO ] Computed 200 invariants in 4 ms
[2024-06-01 21:36:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 21:36:50] [INFO ] Invariant cache hit.
[2024-06-01 21:36:50] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-06-01 21:36:50] [INFO ] Redundant transitions in 18 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 21:36:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 1002 constraints, problems are : Problem set: 0 solved, 400 unsolved in 20979 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27817 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 48900ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 48910ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49482 ms. Remains : 401/401 places, 401/401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 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 :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 581 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 34987 steps, run visited all 4 properties in 235 ms. (steps per millisecond=148 )
Probabilistic random walk after 34987 steps, saw 34043 distinct states, run finished after 236 ms. (steps per millisecond=148 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 233 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 442 ms.
Product exploration explored 100000 steps with 0 reset in 546 ms.
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 21:37:41] [INFO ] Invariant cache hit.
[2024-06-01 21:37:42] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 21:37:42] [INFO ] Invariant cache hit.
[2024-06-01 21:37:42] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-01 21:37:42] [INFO ] Redundant transitions in 6 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 21:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 1002 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21357 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 26882 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 48320ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 48324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48841 ms. Remains : 401/401 places, 401/401 transitions.
Treatment of property ShieldRVt-PT-050A-LTLFireability-00 finished in 103501 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((p0 U p1))))'
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 3 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-06-01 21:38:30] [INFO ] Computed 201 invariants in 2 ms
[2024-06-01 21:38:31] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 21:38:31] [INFO ] Invariant cache hit.
[2024-06-01 21:38:31] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:38:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 20803 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23335 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 44203ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 44206ms
Finished structural reductions in LTL mode , in 1 iterations and 44836 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-02 finished in 45005 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)||(X(p1)&&(p2 U p3))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-06-01 21:39:15] [INFO ] Invariant cache hit.
[2024-06-01 21:39:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 21:39:15] [INFO ] Invariant cache hit.
[2024-06-01 21:39:16] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 21361 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23499 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 44925ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 44929ms
Finished structural reductions in LTL mode , in 1 iterations and 45425 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-03 finished in 45697 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||(p0 U p1))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 23 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-06-01 21:40:01] [INFO ] Computed 201 invariants in 3 ms
[2024-06-01 21:40:01] [INFO ] Implicit Places using invariants in 167 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 464 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-04 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-06-01 21:40:02] [INFO ] Computed 201 invariants in 2 ms
[2024-06-01 21:40:02] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 21:40:02] [INFO ] Invariant cache hit.
[2024-06-01 21:40:02] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:40:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 21349 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 22718 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 44149ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 44154ms
Finished structural reductions in LTL mode , in 1 iterations and 44638 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 505 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-07 finished in 45218 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||(p1&&G(p2))))||((p0||(p1&&G(p2)))&&F(p3))))'
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 19 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-06-01 21:40:47] [INFO ] Computed 201 invariants in 2 ms
[2024-06-01 21:40:47] [INFO ] Implicit Places using invariants in 177 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 448 ms.
Product exploration explored 100000 steps with 0 reset in 549 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3)))), (X p0), (X p1), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 126 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 575 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
RANDOM walk for 40000 steps (8 resets) in 462 ms. (86 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 252156 steps, run visited all 17 properties in 1845 ms. (steps per millisecond=136 )
Probabilistic random walk after 252156 steps, saw 247560 distinct states, run finished after 1846 ms. (steps per millisecond=136 ) properties seen :17
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3)))), (X p0), (X p1), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p3 (NOT p1) (NOT p2)))), (F (NOT (AND (OR (NOT p0) p3 (NOT p2)) (OR p3 (NOT p1) (NOT p2))))), (F (NOT (OR p0 (NOT p3) p1 p2))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p3) p1 p2))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (F (NOT (OR p0 (NOT p3) (NOT p1) p2))), (F (NOT (AND (OR p0 p3 p1) (OR p0 p3 p2)))), (F (NOT (OR p0 (NOT p3) p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p3) p1 (NOT p2)))), (F (NOT p1)), (F p3), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1) p2))), (F (NOT (OR p0 (NOT p3) (NOT p1) (NOT p2))))]
Knowledge based reduction with 17 factoid took 610 ms. Reduced automaton from 12 states, 49 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 476 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 484 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-06-01 21:40:53] [INFO ] Computed 200 invariants in 15 ms
[2024-06-01 21:40:53] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 21:40:53] [INFO ] Invariant cache hit.
[2024-06-01 21:40:53] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-06-01 21:40:53] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 21:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 1002 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21475 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27538 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 49114ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 49118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49640 ms. Remains : 401/401 places, 401/401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3 (NOT p1) p2))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) p2))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 p2))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X p0), (X (NOT (AND p0 p3 p1 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p3 p1 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 105 ms. Reduced automaton from 12 states, 49 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 470 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
RANDOM walk for 40000 steps (8 resets) in 418 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 252156 steps, run visited all 17 properties in 1667 ms. (steps per millisecond=151 )
Probabilistic random walk after 252156 steps, saw 247560 distinct states, run finished after 1668 ms. (steps per millisecond=151 ) properties seen :17
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3 (NOT p1) p2))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) p2))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 p2))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X p0), (X (NOT (AND p0 p3 p1 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p3 p1 p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1 p3) (OR p0 p3 p2)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p3) p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3) p2))), (F (NOT (OR p0 p1 (NOT p3) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (OR (NOT p0) p1 (NOT p3) (NOT p2)))), (F p2), (F p3), (F (NOT (OR p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p3 (NOT p2)))), (F (NOT (OR p0 p1 (NOT p3) p2))), (F (NOT (AND (OR (NOT p0) p3 (NOT p2)) (OR (NOT p1) p3 (NOT p2)))))]
Knowledge based reduction with 35 factoid took 594 ms. Reduced automaton from 12 states, 49 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 564 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 497 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 475 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 475 ms.
Product exploration explored 100000 steps with 0 reset in 545 ms.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 21:41:48] [INFO ] Invariant cache hit.
[2024-06-01 21:41:48] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 21:41:48] [INFO ] Invariant cache hit.
[2024-06-01 21:41:49] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-01 21:41:49] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 21:41:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 1002 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21186 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27622 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 48887ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 48891ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49396 ms. Remains : 401/401 places, 401/401 transitions.
Treatment of property ShieldRVt-PT-050A-LTLFireability-08 finished in 110721 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 U p1)) U p1)||(G(p2) U p0)))'
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-06-01 21:42:38] [INFO ] Computed 201 invariants in 1 ms
[2024-06-01 21:42:38] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 21:42:38] [INFO ] Invariant cache hit.
[2024-06-01 21:42:38] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 21113 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23694 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 44871ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 44876ms
Finished structural reductions in LTL mode , in 1 iterations and 45356 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-10 finished in 45634 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' '!((((p0||X(p1)) U (G((p0||X(p1)))||(!p2&&(p0||X(p1)))))&&G(F(p3))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 3 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-06-01 21:43:23] [INFO ] Invariant cache hit.
[2024-06-01 21:43:23] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 21:43:23] [INFO ] Invariant cache hit.
[2024-06-01 21:43:24] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:43:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 21532 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23740 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 45336ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 45340ms
Finished structural reductions in LTL mode , in 1 iterations and 45838 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-11
Product exploration explored 100000 steps with 6 reset in 463 ms.
Product exploration explored 100000 steps with 5 reset in 547 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 67 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p3), (NOT p3)]
RANDOM walk for 30370 steps (6 resets) in 202 ms. (149 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT p1)), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 9 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p3), (NOT p3)]
Support contains 3 out of 403 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 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 12 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-06-01 21:44:11] [INFO ] Computed 201 invariants in 2 ms
[2024-06-01 21:44:11] [INFO ] Implicit Places using invariants in 171 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 401/403 places, 401/402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p3), (NOT p3)]
RANDOM walk for 23329 steps (4 resets) in 145 ms. (159 steps per ms) remains 0/1 properties
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 3 reset in 433 ms.
Product exploration explored 100000 steps with 6 reset in 524 ms.
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-06-01 21:44:12] [INFO ] Computed 200 invariants in 4 ms
[2024-06-01 21:44:13] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 21:44:13] [INFO ] Invariant cache hit.
[2024-06-01 21:44:13] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-01 21:44:13] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 21:44:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 1002 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21378 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28015 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 49465ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 49468ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49960 ms. Remains : 401/401 places, 401/401 transitions.
Treatment of property ShieldRVt-PT-050A-LTLFireability-11 finished in 99147 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||(p1&&X(p2)))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-06-01 21:45:02] [INFO ] Computed 201 invariants in 1 ms
[2024-06-01 21:45:03] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 21:45:03] [INFO ] Invariant cache hit.
[2024-06-01 21:45:03] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:45:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 21074 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23190 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 44327ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 44330ms
Finished structural reductions in LTL mode , in 1 iterations and 44795 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 441 ms.
Product exploration explored 100000 steps with 0 reset in 533 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (AND p0 p2)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 122 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (8 resets) in 533 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 417 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 315 ms. (126 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 7285 steps, run visited all 8 properties in 160 ms. (steps per millisecond=45 )
Probabilistic random walk after 7285 steps, saw 7098 distinct states, run finished after 161 ms. (steps per millisecond=45 ) properties seen :8
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (AND p0 p2)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (AND p2 (OR p0 p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (AND p2 p0))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 17 factoid took 190 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050A-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050A-LTLFireability-12 finished in 47523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 16 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-06-01 21:45:50] [INFO ] Computed 201 invariants in 1 ms
[2024-06-01 21:45:50] [INFO ] Implicit Places using invariants in 165 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 426 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-13 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 7 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 17 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
[2024-06-01 21:45:51] [INFO ] Invariant cache hit.
[2024-06-01 21:45:51] [INFO ] Implicit Places using invariants in 177 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-14
Product exploration explored 100000 steps with 31 reset in 432 ms.
Stack based approach found an accepted trace after 26026 steps with 7 reset with depth 2347 and stack size 974 in 139 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-14 finished in 854 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)||X(X(X(F(p1))))))'
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-06-01 21:45:51] [INFO ] Computed 201 invariants in 1 ms
[2024-06-01 21:45:52] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 21:45:52] [INFO ] Invariant cache hit.
[2024-06-01 21:45:52] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 21:45:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 20874 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23583 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 44534ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 44538ms
Finished structural reductions in LTL mode , in 1 iterations and 45008 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 477 ms.
Product exploration explored 100000 steps with 0 reset in 569 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 903 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 563560 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :2 out of 3
Probabilistic random walk after 563560 steps, saw 552559 distinct states, run finished after 3007 ms. (steps per millisecond=187 ) properties seen :2
[2024-06-01 21:46:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/403 variables, 200/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 400/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 1/805 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Domain max(s): 1/403 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/403 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050A-LTLFireability-15 finished in 50406 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)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(p1&&G(p2))))||((p0||(p1&&G(p2)))&&F(p3))))'
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' '!((((p0||X(p1)) U (G((p0||X(p1)))||(!p2&&(p0||X(p1)))))&&G(F(p3))))'
[2024-06-01 21:46:42] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:46:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 21:46:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 403 places, 402 transitions and 1704 arcs took 5 ms.
Total runtime 655513 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldRVt-PT-050A-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-050A-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-050A-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717278477716

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 ShieldRVt-PT-050A-LTLFireability-00
ltl formula formula --ltl=/tmp/1728/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 403 places, 402 transitions and 1704 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.070 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1728/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1728/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1728/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1728/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 404 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 404, there are 443 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( 3/ 4): ~2492 levels ~10000 states ~75744 transitions
pnml2lts-mc( 3/ 4): ~4985 levels ~20000 states ~162988 transitions
pnml2lts-mc( 3/ 4): ~9963 levels ~40000 states ~330024 transitions
pnml2lts-mc( 3/ 4): ~19928 levels ~80000 states ~712652 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~18667!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13
pnml2lts-mc( 0/ 4): unique states count: 57166
pnml2lts-mc( 0/ 4): unique transitions count: 524582
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 150097
pnml2lts-mc( 0/ 4): - claim success count: 57176
pnml2lts-mc( 0/ 4): - cum. max stack depth: 57039
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 57179 states 524632 transitions, fanout: 9.175
pnml2lts-mc( 0/ 4): Total exploration time 1.280 sec (1.260 sec minimum, 1.273 sec on average)
pnml2lts-mc( 0/ 4): States per second: 44671, Transitions per second: 409869
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.0MB, 16.0 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 405 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-050A-LTLFireability-08
ltl formula formula --ltl=/tmp/1728/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 403 places, 402 transitions and 1704 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1728/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1728/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1728/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1728/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 404 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 404, there are 567 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( 3/ 4): ~2491 levels ~10000 states ~88640 transitions
pnml2lts-mc( 3/ 4): ~4991 levels ~20000 states ~189012 transitions
pnml2lts-mc( 3/ 4): ~9988 levels ~40000 states ~393104 transitions
pnml2lts-mc( 3/ 4): ~19946 levels ~80000 states ~825240 transitions
pnml2lts-mc( 3/ 4): ~39936 levels ~160000 states ~1755716 transitions
pnml2lts-mc( 3/ 4): ~79931 levels ~320000 states ~3715888 transitions
pnml2lts-mc( 3/ 4): ~159915 levels ~640000 states ~7905424 transitions
pnml2lts-mc( 1/ 4): ~318938 levels ~1280000 states ~16274868 transitions
pnml2lts-mc( 1/ 4): ~637182 levels ~2560000 states ~34612544 transitions
pnml2lts-mc( 1/ 4): ~1276921 levels ~5120000 states ~70639032 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 471220
pnml2lts-mc( 0/ 4): unique states count: 4994620
pnml2lts-mc( 0/ 4): unique transitions count: 65563840
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 19064358
pnml2lts-mc( 0/ 4): - claim success count: 4994628
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4522110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4994631 states 65563877 transitions, fanout: 13.127
pnml2lts-mc( 0/ 4): Total exploration time 71.480 sec (71.440 sec minimum, 71.458 sec on average)
pnml2lts-mc( 0/ 4): States per second: 69875, Transitions per second: 917234
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 287.9MB, 9.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/49.0%
pnml2lts-mc( 0/ 4): Stored 405 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 287.9MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-050A-LTLFireability-11
ltl formula formula --ltl=/tmp/1728/ltl_2_
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 403 places, 402 transitions and 1704 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.040 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1728/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1728/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1728/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1728/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 405 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 404, there are 435 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( 0/ 4): ~2461 levels ~10000 states ~80024 transitions
pnml2lts-mc( 0/ 4): ~4942 levels ~20000 states ~162312 transitions
pnml2lts-mc( 0/ 4): ~9910 levels ~40000 states ~343192 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~9074!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 31513
pnml2lts-mc( 0/ 4): unique transitions count: 333467
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 89442
pnml2lts-mc( 0/ 4): - claim success count: 31530
pnml2lts-mc( 0/ 4): - cum. max stack depth: 31424
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 31530 states 333522 transitions, fanout: 10.578
pnml2lts-mc( 0/ 4): Total exploration time 0.680 sec (0.680 sec minimum, 0.680 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46368, Transitions per second: 490474
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.3MB, 13.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 405 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.3MB (~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="ShieldRVt-PT-050A"
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 ShieldRVt-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762401028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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