About the Execution of LTSMin+red for ShieldRVs-PT-002A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
350.855 | 25255.00 | 39401.00 | 375.20 | FFFFFFFTFFFFFFFF | 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-171683761700724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVs-PT-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761700724
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 13K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-002A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717262521153
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:22:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:22:02] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-06-01 17:22:02] [INFO ] Transformed 31 places.
[2024-06-01 17:22:02] [INFO ] Transformed 41 transitions.
[2024-06-01 17:22:02] [INFO ] Found NUPN structural information;
[2024-06-01 17:22:02] [INFO ] Parsed PT model containing 31 places and 41 transitions and 184 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVs-PT-002A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 16 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-06-01 17:22:02] [INFO ] Computed 9 invariants in 8 ms
[2024-06-01 17:22:03] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 17:22:03] [INFO ] Invariant cache hit.
[2024-06-01 17:22:03] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 9 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 964 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1129 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 2147ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2159ms
Finished structural reductions in LTL mode , in 1 iterations and 2456 ms. Remains : 31/31 places, 41/41 transitions.
Support contains 25 out of 31 places after structural reductions.
[2024-06-01 17:22:05] [INFO ] Flatten gal took : 22 ms
[2024-06-01 17:22:05] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:22:05] [INFO ] Input system was already deterministic with 41 transitions.
Reduction of identical properties reduced properties to check from 24 to 20
RANDOM walk for 1699 steps (44 resets) in 93 ms. (18 steps per ms) remains 0/20 properties
FORMULA ShieldRVs-PT-002A-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((F(p1) U G(p2)))&&p0))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 41/41 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 30 transition count 40
Applied a total of 2 rules in 14 ms. Remains 30 /31 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-06-01 17:22:05] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 17:22:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 17:22:05] [INFO ] Invariant cache hit.
[2024-06-01 17:22:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-01 17:22:05] [INFO ] Redundant transitions in 17 ms returned [12]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2024-06-01 17:22:06] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/69 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:07] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 87 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1188 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:07] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:07] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 39/69 variables, 30/89 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 38/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:22:07] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/69 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 128 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1005 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 21/21 constraints]
After SMT, in 2208ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 39/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2326 ms. Remains : 30/31 places, 39/41 transitions.
Stuttering acceptance computed with spot in 439 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-02
Stuttering criterion allowed to conclude after 66 steps with 2 reset in 5 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-02 finished in 2835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-06-01 17:22:08] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 17:22:08] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 17:22:08] [INFO ] Invariant cache hit.
[2024-06-01 17:22:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 6 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 13 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1051 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:10] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:10] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:10] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 879 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1956ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1957ms
Finished structural reductions in LTL mode , in 1 iterations and 2032 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 347 steps with 8 reset in 6 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-03 finished in 2158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:10] [INFO ] Invariant cache hit.
[2024-06-01 17:22:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 17:22:10] [INFO ] Invariant cache hit.
[2024-06-01 17:22:10] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 783 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 859 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1670ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1678ms
Finished structural reductions in LTL mode , in 1 iterations and 1754 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-04 finished in 1840 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((G(F(p1))&&p0))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:12] [INFO ] Invariant cache hit.
[2024-06-01 17:22:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 17:22:12] [INFO ] Invariant cache hit.
[2024-06-01 17:22:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 768 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 905 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1686ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1686ms
Finished structural reductions in LTL mode , in 1 iterations and 1768 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-05
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-05 finished in 2000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((X(p2)&&p1))))'
Support contains 8 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:14] [INFO ] Invariant cache hit.
[2024-06-01 17:22:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 17:22:14] [INFO ] Invariant cache hit.
[2024-06-01 17:22:14] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 713 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 903 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1627ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1628ms
Finished structural reductions in LTL mode , in 1 iterations and 1695 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-09
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-09 finished in 1878 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(((p1||(!p1 U !p2))&&p0))||X(p1)))'
Support contains 7 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:16] [INFO ] Invariant cache hit.
[2024-06-01 17:22:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 17:22:16] [INFO ] Invariant cache hit.
[2024-06-01 17:22:16] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:17] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 734 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:17] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:17] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:17] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 878 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1625ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1625ms
Finished structural reductions in LTL mode , in 1 iterations and 1696 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2))]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-10
Stuttering criterion allowed to conclude after 65 steps with 2 reset in 0 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-10 finished in 1917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:18] [INFO ] Invariant cache hit.
[2024-06-01 17:22:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 17:22:18] [INFO ] Invariant cache hit.
[2024-06-01 17:22:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:22:18] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:19] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 766 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:19] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:19] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:19] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 894 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1669ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1670ms
Finished structural reductions in LTL mode , in 1 iterations and 1744 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-11 finished in 2065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U p1)))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:20] [INFO ] Invariant cache hit.
[2024-06-01 17:22:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 17:22:20] [INFO ] Invariant cache hit.
[2024-06-01 17:22:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:21] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 726 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:21] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:21] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:21] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 917 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1657ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1659ms
Finished structural reductions in LTL mode , in 1 iterations and 1734 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-12 finished in 1908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(G(p1)) U p2)&&p0))))'
Support contains 7 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:22] [INFO ] Invariant cache hit.
[2024-06-01 17:22:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 17:22:22] [INFO ] Invariant cache hit.
[2024-06-01 17:22:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 690 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 898 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1598ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1598ms
Finished structural reductions in LTL mode , in 1 iterations and 1671 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-13 finished in 1866 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) U X(((p1&&X(p1)) U (G((p1&&X(p1)))||(p1&&G(p0)&&X(p1)))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:22:24] [INFO ] Invariant cache hit.
[2024-06-01 17:22:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 17:22:24] [INFO ] Invariant cache hit.
[2024-06-01 17:22:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:22:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 736 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:25] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:25] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:22:25] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 880 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1627ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1628ms
Finished structural reductions in LTL mode , in 1 iterations and 1710 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND p0 (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLFireability-14 finished in 2056 ms.
All properties solved by simple procedures.
Total runtime 24004 ms.
ITS solved all properties within timeout
BK_STOP 1717262546408
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-002A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-002A, 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-171683761700724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-002A.tgz
mv ShieldRVs-PT-002A 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 '
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 ;