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-171683762301012.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-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762301012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 23:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 22:43 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 109K 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-040A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717277059237

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-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:24:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:24:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:24:20] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 21:24:20] [INFO ] Transformed 323 places.
[2024-06-01 21:24:20] [INFO ] Transformed 323 transitions.
[2024-06-01 21:24:20] [INFO ] Found NUPN structural information;
[2024-06-01 21:24:20] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-040A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 46 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-06-01 21:24:20] [INFO ] Computed 161 invariants in 9 ms
[2024-06-01 21:24:21] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 21:24:21] [INFO ] Invariant cache hit.
[2024-06-01 21:24:21] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14500 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 15698 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30331ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30349ms
Finished structural reductions in LTL mode , in 1 iterations and 31040 ms. Remains : 323/323 places, 322/322 transitions.
Support contains 40 out of 323 places after structural reductions.
[2024-06-01 21:24:51] [INFO ] Flatten gal took : 62 ms
[2024-06-01 21:24:51] [INFO ] Flatten gal took : 29 ms
[2024-06-01 21:24:52] [INFO ] Input system was already deterministic with 322 transitions.
Reduction of identical properties reduced properties to check from 25 to 21
RANDOM walk for 40000 steps (8 resets) in 1584 ms. (25 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
[2024-06-01 21:24:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 20/45 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 278/323 variables, 139/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 278/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 10 unsolved in 613 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 20/45 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 278/323 variables, 139/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 278/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 10/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 817 constraints, problems are : Problem set: 0 solved, 10 unsolved in 650 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 1271ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 44187 steps, including 967 resets, run visited all 1 properties in 184 ms. (steps per millisecond=240 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 1753 ms.
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' '!(X((X(p0) U (X(G(p0))||(!p1&&X((p0&&(p1 U p2))))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 11 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-06-01 21:24:56] [INFO ] Invariant cache hit.
[2024-06-01 21:24:56] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 21:24:56] [INFO ] Invariant cache hit.
[2024-06-01 21:24:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:24:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13953 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16297 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30310ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30315ms
Finished structural reductions in LTL mode , in 1 iterations and 30688 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 10887 steps with 0 reset in 98 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-00 finished in 31205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 46 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-06-01 21:25:27] [INFO ] Computed 161 invariants in 6 ms
[2024-06-01 21:25:28] [INFO ] Implicit Places using invariants in 144 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 20 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 446 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-01 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G((X(p1)||G(p2))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-06-01 21:25:28] [INFO ] Computed 161 invariants in 2 ms
[2024-06-01 21:25:28] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 21:25:28] [INFO ] Invariant cache hit.
[2024-06-01 21:25:29] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:25:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13867 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16016 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 29966ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 29969ms
Finished structural reductions in LTL mode , in 1 iterations and 30365 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p0), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-02 finished in 30822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||G(p2))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-06-01 21:25:59] [INFO ] Invariant cache hit.
[2024-06-01 21:25:59] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 21:25:59] [INFO ] Invariant cache hit.
[2024-06-01 21:25:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:25:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13924 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16028 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30018ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30021ms
Finished structural reductions in LTL mode , in 1 iterations and 30396 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-03 finished in 30606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-06-01 21:26:30] [INFO ] Invariant cache hit.
[2024-06-01 21:26:30] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 21:26:30] [INFO ] Invariant cache hit.
[2024-06-01 21:26:30] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:26:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14084 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16258 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30391ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30395ms
Finished structural reductions in LTL mode , in 1 iterations and 30775 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 65443 steps with 0 reset in 264 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-04 finished in 31185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 31 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-06-01 21:27:01] [INFO ] Computed 161 invariants in 4 ms
[2024-06-01 21:27:01] [INFO ] Implicit Places using invariants in 150 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 401 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-06 finished in 642 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((X((p0&&(p1||X(p2))))&&(!p3 U (p4||G(!p3)))))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-06-01 21:27:01] [INFO ] Computed 161 invariants in 4 ms
[2024-06-01 21:27:02] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 21:27:02] [INFO ] Invariant cache hit.
[2024-06-01 21:27:02] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:27:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14067 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16068 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30183ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Finished structural reductions in LTL mode , in 1 iterations and 30567 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-07
Product exploration explored 100000 steps with 33404 reset in 735 ms.
Product exploration explored 100000 steps with 33318 reset in 746 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 p4 (NOT p3) p0 p1 p2), (X (NOT p3)), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X p4), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 178 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 7 states, 25 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (8 resets) in 474 ms. (84 steps per ms) remains 18/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 18/18 properties
[2024-06-01 21:27:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 18 unsolved in 602 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf12 is UNSAT
Problem apf14 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 11/818 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/818 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/818 constraints. Problems are: Problem set: 7 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 818 constraints, problems are : Problem set: 7 solved, 11 unsolved in 772 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 11/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 7 solved, 11 unsolved
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 3 properties in 6433 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 323 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 323 transition count 284
Applied a total of 76 rules in 30 ms. Remains 323 /323 variables (removed 0) and now considering 284/322 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 323/323 places, 284/322 transitions.
Reduction of identical properties reduced properties to check from 8 to 5
RANDOM walk for 39165 steps (8 resets) in 280 ms. (139 steps per ms) remains 0/5 properties
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p4 (NOT p3) p0 p1 p2), (X (NOT p3)), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X p4), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X p1)), (G (AND (OR p3 p2) (OR (NOT p4) p2))), (G (OR p3 p4 (NOT p0) p2)), (G (OR p3 p4 (NOT p0) p1 p2)), (G (AND (OR p3 (NOT p0) p1 p2) (OR (NOT p4) (NOT p0) p1 p2))), (G (OR p3 p4 p2)), (G (OR p3 p4 p0 p2)), (G (AND (OR p3 p0 p2) (OR (NOT p4) p0 p2)))]
False Knowledge obtained : [(F (NOT (OR p3 p4 (NOT p0) p1))), (F (NOT (OR (NOT p3) p4))), (F (NOT p1)), (F (NOT (OR (NOT p3) p4 p0))), (F (NOT p2)), (F (NOT p4)), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p3) p4 (NOT p0) p1 p2))), (F (NOT (OR p3 p4 p0))), (F (NOT (OR (NOT p3) p4 (NOT p0) p2))), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR (NOT p3) p4 p2))), (F (NOT (AND (OR p3 p0) (OR (NOT p4) p0)))), (F (NOT (OR p3 p4))), (F (NOT (OR (NOT p3) p4 (NOT p0) p1))), (F (NOT (OR (NOT p3) p4 p0 p2))), (F (NOT (AND (OR p3 (NOT p0) p1) (OR (NOT p4) (NOT p0) p1))))]
Knowledge based reduction with 46 factoid took 1473 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-06-01 21:27:45] [INFO ] Invariant cache hit.
[2024-06-01 21:27:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 21:27:45] [INFO ] Invariant cache hit.
[2024-06-01 21:27:45] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:27:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14044 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16167 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30262ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30265ms
Finished structural reductions in LTL mode , in 1 iterations and 30641 ms. Remains : 323/323 places, 322/322 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 p3) p4 p0 p1 p2), (X (NOT p3)), (X p4), (X (OR (NOT p3) p4)), (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0))))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 (NOT p4) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X p4)), (X (X (OR (NOT p3) p4))), (X (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 507 ms. Reduced automaton from 7 states, 18 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
[2024-06-01 21:28:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 7 unsolved in 302 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 7/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 814 constraints, problems are : Problem set: 0 solved, 7 unsolved in 528 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 838ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 18918 steps, including 998 resets, run visited all 4 properties in 254 ms. (steps per millisecond=74 )
Parikh walk visited 7 properties in 1484 ms.
Knowledge obtained : [(AND (NOT p3) p4 p0 p1 p2), (X (NOT p3)), (X p4), (X (OR (NOT p3) p4)), (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0))))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 (NOT p4) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X p4)), (X (X (OR (NOT p3) p4))), (X (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (OR p3 p0) (OR (NOT p4) p0)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p3) p4))), (F (NOT p0)), (F (NOT (OR p3 p4 (NOT p0) p1))), (F (NOT (AND (OR p3 (NOT p0) p1) (OR (NOT p4) (NOT p0) p1)))), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR p3 p4 p0))), (F (NOT (OR (NOT p3) p4 p0))), (F (NOT (OR p3 p4))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT p4)), (F (NOT p1)), (F p3), (F (NOT (OR (NOT p3) p4 (NOT p0) p1))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 31 factoid took 1361 ms. Reduced automaton from 7 states, 18 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33233 reset in 695 ms.
Product exploration explored 100000 steps with 33201 reset in 739 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 9 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-06-01 21:28:23] [INFO ] Invariant cache hit.
[2024-06-01 21:28:24] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 21:28:24] [INFO ] Invariant cache hit.
[2024-06-01 21:28:24] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 21:28:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14234 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16211 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30496ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30499ms
Finished structural reductions in LTL mode , in 1 iterations and 30866 ms. Remains : 323/323 places, 322/322 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-07 finished in 113049 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(p0)||(p0&&F(!p1))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 13 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-06-01 21:28:54] [INFO ] Computed 161 invariants in 1 ms
[2024-06-01 21:28:55] [INFO ] Implicit Places using invariants in 140 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 388 ms.
Product exploration explored 100000 steps with 0 reset in 496 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 25974 steps, run visited all 4 properties in 150 ms. (steps per millisecond=173 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 153 ms. (steps per millisecond=169 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 15 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2024-06-01 21:28:57] [INFO ] Computed 160 invariants in 3 ms
[2024-06-01 21:28:57] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 21:28:57] [INFO ] Invariant cache hit.
[2024-06-01 21:28:57] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-01 21:28:57] [INFO ] Redundant transitions in 17 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-01 21:28:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14201 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 320/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 1122 constraints, problems are : Problem set: 0 solved, 320 unsolved in 15370 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 29619ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 29622ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30070 ms. Remains : 321/321 places, 321/321 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 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 25974 steps, run visited all 4 properties in 146 ms. (steps per millisecond=177 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 147 ms. (steps per millisecond=176 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 243 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 388 ms.
Product exploration explored 100000 steps with 0 reset in 490 ms.
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-06-01 21:29:29] [INFO ] Invariant cache hit.
[2024-06-01 21:29:29] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 21:29:29] [INFO ] Invariant cache hit.
[2024-06-01 21:29:29] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-06-01 21:29:29] [INFO ] Redundant transitions in 6 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-01 21:29:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 320 unsolved in 13847 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 320/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 1122 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14991 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 28887ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 28892ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29313 ms. Remains : 321/321 places, 321/321 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-08 finished in 63720 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)) U (p1 U p2)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 20 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-06-01 21:29:58] [INFO ] Computed 160 invariants in 3 ms
[2024-06-01 21:29:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 21:29:58] [INFO ] Invariant cache hit.
[2024-06-01 21:29:59] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-01 21:29:59] [INFO ] Redundant transitions in 3 ms returned []
Running 319 sub problems to find dead transitions.
[2024-06-01 21:29:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 10876 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 12695 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 23609ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 23612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24012 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), p0]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 408 ms.
Stack based approach found an accepted trace after 10168 steps with 0 reset with depth 10169 and stack size 2863 in 48 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-09 finished in 24573 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 U p1)||X(F(p1))))'
Support contains 1 out of 323 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 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 17 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-06-01 21:30:23] [INFO ] Computed 161 invariants in 3 ms
[2024-06-01 21:30:23] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 21:30:23] [INFO ] Invariant cache hit.
[2024-06-01 21:30:23] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-01 21:30:23] [INFO ] Redundant transitions in 1 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-01 21:30:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/643 variables, 322/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 0/643 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 805 constraints, problems are : Problem set: 0 solved, 320 unsolved in 10940 ms.
Refiners :[Domain max(s): 322/322 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/643 variables, 322/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 320/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/643 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 1125 constraints, problems are : Problem set: 0 solved, 320 unsolved in 13506 ms.
Refiners :[Domain max(s): 322/322 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 24486ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 24489ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24895 ms. Remains : 322/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 374 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-13 finished in 25326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 12 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-06-01 21:30:48] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 21:30:48] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 21:30:48] [INFO ] Invariant cache hit.
[2024-06-01 21:30:48] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-06-01 21:30:48] [INFO ] Redundant transitions in 1 ms returned []
Running 319 sub problems to find dead transitions.
[2024-06-01 21:30:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 11029 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13086 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 24156ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 24159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24554 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-14
Product exploration explored 100000 steps with 10 reset in 367 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-040A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-14 finished in 25007 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((X((p0&&(p1||X(p2))))&&(!p3 U (p4||G(!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' '!(G(F((G(p0)||(p0&&F(!p1))))))'
[2024-06-01 21:31:13] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:31:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 21:31:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 323 places, 322 transitions and 1364 arcs took 7 ms.
Total runtime 413551 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldRVt-PT-040A-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-040A-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717277475548

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVt-PT-040A-LTLFireability-07
ltl formula formula --ltl=/tmp/1390/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 323 places, 322 transitions and 1364 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 324 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 324, there are 978 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):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~137!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2546
pnml2lts-mc( 0/ 4): unique states count: 3510
pnml2lts-mc( 0/ 4): unique transitions count: 15216
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1592
pnml2lts-mc( 0/ 4): - claim found count: 999
pnml2lts-mc( 0/ 4): - claim success count: 3536
pnml2lts-mc( 0/ 4): - cum. max stack depth: 976
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3536 states 15306 transitions, fanout: 4.329
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 50514, Transitions per second: 218657
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 20.4 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 325 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-040A-LTLFireability-08
ltl formula formula --ltl=/tmp/1390/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
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 323 places, 322 transitions and 1364 arcs
Warning: program compiled against libxml 210 using older 209
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.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1390/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1390/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1390/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1390/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 324 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 324, there are 332 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): ~2489 levels ~10000 states ~75084 transitions
pnml2lts-mc( 0/ 4): ~4983 levels ~20000 states ~159752 transitions
pnml2lts-mc( 0/ 4): ~9972 levels ~40000 states ~337840 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~15475!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13
pnml2lts-mc( 0/ 4): unique states count: 65331
pnml2lts-mc( 0/ 4): unique transitions count: 644264
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 182548
pnml2lts-mc( 0/ 4): - claim success count: 65356
pnml2lts-mc( 0/ 4): - cum. max stack depth: 65190
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 65356 states 644348 transitions, fanout: 9.859
pnml2lts-mc( 0/ 4): Total exploration time 0.990 sec (0.990 sec minimum, 0.990 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66016, Transitions per second: 650857
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.9MB, 16.2 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 325 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.9MB (~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-040A"
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-040A, 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-171683762301012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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