fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683762300996
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
540.056 311698.00 381337.00 1029.00 FTFFFFFTFTFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K 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 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 01:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 00:23 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 82K 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-030A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717276498146

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-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:14:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:14:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:14:59] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-01 21:14:59] [INFO ] Transformed 243 places.
[2024-06-01 21:14:59] [INFO ] Transformed 243 transitions.
[2024-06-01 21:14:59] [INFO ] Found NUPN structural information;
[2024-06-01 21:14:59] [INFO ] Parsed PT model containing 243 places and 243 transitions and 1026 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-030A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 30 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-06-01 21:14:59] [INFO ] Computed 121 invariants in 14 ms
[2024-06-01 21:15:00] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 21:15:00] [INFO ] Invariant cache hit.
[2024-06-01 21:15:00] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:15:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8398 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10074 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18585ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18602ms
Finished structural reductions in LTL mode , in 1 iterations and 19163 ms. Remains : 243/243 places, 242/242 transitions.
Support contains 58 out of 243 places after structural reductions.
[2024-06-01 21:15:19] [INFO ] Flatten gal took : 75 ms
[2024-06-01 21:15:19] [INFO ] Flatten gal took : 40 ms
[2024-06-01 21:15:19] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40000 steps (8 resets) in 2029 ms. (19 steps per ms) remains 15/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
[2024-06-01 21:15:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/49 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 194/243 variables, 97/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 15 unsolved in 798 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/49 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 194/243 variables, 97/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 15/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 622 constraints, problems are : Problem set: 0 solved, 15 unsolved in 769 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1590ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 11 different solutions.
Finished Parikh walk after 23151 steps, including 998 resets, run visited all 1 properties in 79 ms. (steps per millisecond=293 )
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 )
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 15 properties in 1089 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' '!((p0 U X(G(p1))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 17 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:15:23] [INFO ] Invariant cache hit.
[2024-06-01 21:15:23] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 21:15:23] [INFO ] Invariant cache hit.
[2024-06-01 21:15:23] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8017 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9846 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17905ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17907ms
Finished structural reductions in LTL mode , in 1 iterations and 18247 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 189 steps with 0 reset in 4 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-00 finished in 18513 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))||((X(p3)||p2)&&p1))))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:15:41] [INFO ] Invariant cache hit.
[2024-06-01 21:15:41] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 21:15:41] [INFO ] Invariant cache hit.
[2024-06-01 21:15:41] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7950 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9914 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17905ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17908ms
Finished structural reductions in LTL mode , in 1 iterations and 18206 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 705 ms.
Product exploration explored 100000 steps with 50000 reset in 624 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 p1 p2 p0 p3), (X p2), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-01 finished in 19770 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&&F(p1)))||(G(p0)&&p2)))&&X(p3))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:16:01] [INFO ] Invariant cache hit.
[2024-06-01 21:16:01] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 21:16:01] [INFO ] Invariant cache hit.
[2024-06-01 21:16:01] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:16:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7895 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9610 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17545ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17547ms
Finished structural reductions in LTL mode , in 1 iterations and 17901 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 334 ms.
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-02 finished in 18533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&X(G(p1)))) U G(p1)))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:16:20] [INFO ] Invariant cache hit.
[2024-06-01 21:16:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 21:16:20] [INFO ] Invariant cache hit.
[2024-06-01 21:16:20] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:16:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8009 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10004 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18050ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18052ms
Finished structural reductions in LTL mode , in 1 iterations and 18358 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-03 finished in 18507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:16:38] [INFO ] Invariant cache hit.
[2024-06-01 21:16:38] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 21:16:38] [INFO ] Invariant cache hit.
[2024-06-01 21:16:38] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:16:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7951 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10122 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18108ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18111ms
Finished structural reductions in LTL mode , in 1 iterations and 18416 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-04
Product exploration explored 100000 steps with 20 reset in 342 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-04 finished in 18839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U X(p2))))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:16:57] [INFO ] Invariant cache hit.
[2024-06-01 21:16:57] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 21:16:57] [INFO ] Invariant cache hit.
[2024-06-01 21:16:57] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7904 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9836 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17775ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17777ms
Finished structural reductions in LTL mode , in 1 iterations and 18073 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 324 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-06 finished in 18537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F(p1)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:17:15] [INFO ] Invariant cache hit.
[2024-06-01 21:17:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 21:17:16] [INFO ] Invariant cache hit.
[2024-06-01 21:17:16] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:17:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8062 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10176 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18274ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18276ms
Finished structural reductions in LTL mode , in 1 iterations and 18569 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 506 ms.
Product exploration explored 100000 steps with 33333 reset in 490 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 p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-07 finished in 19766 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 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:17:35] [INFO ] Invariant cache hit.
[2024-06-01 21:17:35] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 21:17:35] [INFO ] Invariant cache hit.
[2024-06-01 21:17:35] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:17:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8171 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10006 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18223ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18225ms
Finished structural reductions in LTL mode , in 1 iterations and 18543 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 102 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-08 finished in 18675 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||G(F(p1))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:17:54] [INFO ] Invariant cache hit.
[2024-06-01 21:17:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 21:17:54] [INFO ] Invariant cache hit.
[2024-06-01 21:17:54] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-01 21:17:54] [INFO ] Redundant transitions in 9 ms returned []
Running 241 sub problems to find dead transitions.
[2024-06-01 21:17:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8232 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9969 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18237ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18584 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-10
Product exploration explored 100000 steps with 2173 reset in 330 ms.
Stack based approach found an accepted trace after 228 steps with 4 reset with depth 49 and stack size 44 in 1 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-10 finished in 19007 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 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 25 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2024-06-01 21:18:13] [INFO ] Computed 121 invariants in 3 ms
[2024-06-01 21:18:13] [INFO ] Implicit Places using invariants in 123 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 316 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-11 finished in 559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 12 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
[2024-06-01 21:18:13] [INFO ] Invariant cache hit.
[2024-06-01 21:18:14] [INFO ] Implicit Places using invariants in 100 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 10 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 303 ms.
Stack based approach found an accepted trace after 4026 steps with 0 reset with depth 4027 and stack size 1567 in 15 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-12 finished in 489 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 (!p1&&X((!p1 U (G(!p1)||(X(p0)&&p2)))))))'
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-06-01 21:18:14] [INFO ] Computed 121 invariants in 3 ms
[2024-06-01 21:18:14] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 21:18:14] [INFO ] Invariant cache hit.
[2024-06-01 21:18:14] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7952 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9858 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17858ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17861ms
Finished structural reductions in LTL mode , in 1 iterations and 18160 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 270 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-14
Product exploration explored 100000 steps with 24934 reset in 446 ms.
Product exploration explored 100000 steps with 25004 reset in 510 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 114 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 525 ms. (76 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
[2024-06-01 21:18:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 608 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 294ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22727 steps, including 794 resets, run visited all 1 properties in 96 ms. (steps per millisecond=236 )
Parikh walk visited 1 properties in 96 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 22 factoid took 462 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:18:35] [INFO ] Invariant cache hit.
[2024-06-01 21:18:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 21:18:35] [INFO ] Invariant cache hit.
[2024-06-01 21:18:36] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:18:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7984 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10242 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18260ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18263ms
Finished structural reductions in LTL mode , in 1 iterations and 18550 ms. Remains : 243/243 places, 242/242 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 113 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
[2024-06-01 21:18:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 3 unsolved in 184 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 610 constraints, problems are : Problem set: 0 solved, 3 unsolved in 254 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 1141 ms.
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 31 place count 242 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 60 place count 242 transition count 212
Applied a total of 60 rules in 27 ms. Remains 242 /243 variables (removed 1) and now considering 212/242 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 242/243 places, 212/242 transitions.
RANDOM walk for 18599 steps (4 resets) in 71 ms. (258 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 22 factoid took 512 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 274 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 274 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 25027 reset in 462 ms.
Product exploration explored 100000 steps with 25047 reset in 501 ms.
Applying partial POR strategy [false, true, false, true, true, false, true]
Stuttering acceptance computed with spot in 264 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 23 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:18:59] [INFO ] Redundant transitions in 8 ms returned []
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-06-01 21:18:59] [INFO ] Computed 121 invariants in 1 ms
[2024-06-01 21:18:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-01 21:19:02] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 6 ms to minimize.
Problem TDEAD120 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 242/485 variables, 243/608 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 0/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/485 variables, 0/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 610 constraints, problems are : Problem set: 1 solved, 240 unsolved in 22096 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 241/241 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 2/243 variables, 121/362 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 2/364 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 242/485 variables, 243/608 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 240/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 850 constraints, problems are : Problem set: 1 solved, 240 unsolved in 10205 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 240/241 constraints, Known Traps: 1/1 constraints]
After SMT, in 32345ms problems are : Problem set: 1 solved, 240 unsolved
Search for dead transitions found 1 dead transitions in 32349ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 243/243 places, 241/242 transitions.
Graph (complete) has 960 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 242 /243 variables (removed 1) and now considering 241/241 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/243 places, 241/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32418 ms. Remains : 242/243 places, 241/242 transitions.
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-06-01 21:19:31] [INFO ] Computed 121 invariants in 1 ms
[2024-06-01 21:19:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 21:19:32] [INFO ] Invariant cache hit.
[2024-06-01 21:19:32] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:19:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7839 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10036 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17914ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17917ms
Finished structural reductions in LTL mode , in 1 iterations and 18215 ms. Remains : 243/243 places, 242/242 transitions.
Treatment of property ShieldRVt-PT-030A-LTLFireability-14 finished in 95802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X((X(G(p2))&&p1))) U X(X(p3)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 21:19:50] [INFO ] Invariant cache hit.
[2024-06-01 21:19:50] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 21:19:50] [INFO ] Invariant cache hit.
[2024-06-01 21:19:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-01 21:19:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7960 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10069 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18069ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18071ms
Finished structural reductions in LTL mode , in 1 iterations and 18489 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-15 finished in 18947 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 (!p1&&X((!p1 U (G(!p1)||(X(p0)&&p2)))))))'
[2024-06-01 21:20:09] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:20:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 21:20:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 243 places, 242 transitions and 1024 arcs took 6 ms.
Total runtime 310031 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldRVt-PT-030A-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717276809844

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVt-PT-030A-LTLFireability-14
ltl formula formula --ltl=/tmp/1295/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 243 places, 242 transitions and 1024 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1295/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1295/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1295/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1295/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 244 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 244, there are 1060 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 ~903!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3106
pnml2lts-mc( 0/ 4): unique states count: 6223
pnml2lts-mc( 0/ 4): unique transitions count: 49729
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5213
pnml2lts-mc( 0/ 4): - claim found count: 5223
pnml2lts-mc( 0/ 4): - claim success count: 6238
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3120
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6238 states 49826 transitions, fanout: 7.987
pnml2lts-mc( 0/ 4): Total exploration time 0.190 sec (0.160 sec minimum, 0.178 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32832, Transitions per second: 262242
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.6MB, 21.9 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 244 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.6MB (~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-030A"
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-030A, 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-171683762300996"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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