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.r356-tall-171683761700723.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 itstools
Input is ShieldRVs-PT-002A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700723
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-002A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717032500134

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 01:28:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:28:21] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-30 01:28:21] [INFO ] Transformed 31 places.
[2024-05-30 01:28:21] [INFO ] Transformed 41 transitions.
[2024-05-30 01:28:21] [INFO ] Found NUPN structural information;
[2024-05-30 01:28:21] [INFO ] Parsed PT model containing 31 places and 41 transitions and 184 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVs-PT-002A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 9 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-05-30 01:28:21] [INFO ] Computed 9 invariants in 8 ms
[2024-05-30 01:28:21] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 01:28:21] [INFO ] Invariant cache hit.
[2024-05-30 01:28:21] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:21] [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-05-30 01:28:22] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 9 ms to minimize.
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 7 places in 20 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-05-30 01:28:22] [INFO ] Deduced a trap composed of 7 places in 18 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 942 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-05-30 01:28:23] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:28:23] [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-05-30 01:28:23] [INFO ] Deduced a trap composed of 7 places in 21 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 968 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 1962ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1989ms
Finished structural reductions in LTL mode , in 1 iterations and 2243 ms. Remains : 31/31 places, 41/41 transitions.
Support contains 17 out of 31 places after structural reductions.
[2024-05-30 01:28:24] [INFO ] Flatten gal took : 21 ms
[2024-05-30 01:28:24] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:28:24] [INFO ] Input system was already deterministic with 41 transitions.
RANDOM walk for 258 steps (4 resets) in 26 ms. (9 steps per ms) remains 0/14 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&X(p2))))'
Support contains 5 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-05-30 01:28:24] [INFO ] Invariant cache hit.
[2024-05-30 01:28:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 01:28:24] [INFO ] Invariant cache hit.
[2024-05-30 01:28:24] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28: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-05-30 01:28:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:24] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:24] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:24] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:28:24] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:28:24] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:24] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:24] [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-05-30 01:28:24] [INFO ] Deduced a trap composed of 7 places in 19 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 708 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-05-30 01:28:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:28:25] [INFO ] Deduced a trap composed of 8 places in 18 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-05-30 01:28:25] [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 863 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 1593ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1594ms
Finished structural reductions in LTL mode , in 1 iterations and 1679 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLCardinality-00
Product exploration explored 100000 steps with 40046 reset in 275 ms.
Product exploration explored 100000 steps with 39958 reset in 159 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) p2), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 106 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002A-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002A-LTLCardinality-00 finished in 2595 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(G((p1 U p2)))))'
Support contains 5 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-05-30 01:28:26] [INFO ] Invariant cache hit.
[2024-05-30 01:28:26] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 01:28:26] [INFO ] Invariant cache hit.
[2024-05-30 01:28:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:26] [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-05-30 01:28:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:27] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:27] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:27] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:28:27] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:28:27] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:27] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:28:27] [INFO ] Deduced a trap composed of 7 places in 15 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-05-30 01:28:27] [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 706 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-05-30 01:28:27] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:28:28] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:28] [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 872 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 1602ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1603ms
Finished structural reductions in LTL mode , in 1 iterations and 1673 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), true, (NOT p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 87 steps with 21 reset in 1 ms.
FORMULA ShieldRVs-PT-002A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLCardinality-01 finished in 1997 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)&&F(p1)) U X(X(G(p2)))))'
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 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:28:28] [INFO ] Invariant cache hit.
[2024-05-30 01:28:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 01:28:28] [INFO ] Invariant cache hit.
[2024-05-30 01:28:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:28] [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-05-30 01:28:29] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:28:29] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:29] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:29] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:29] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
[2024-05-30 01:28:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 3 ms to minimize.
[2024-05-30 01:28:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 3 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-05-30 01:28:29] [INFO ] Deduced a trap composed of 7 places in 24 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 725 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-05-30 01:28:29] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:30] [INFO ] Deduced a trap composed of 8 places in 21 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-05-30 01:28:30] [INFO ] Deduced a trap composed of 7 places in 20 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 835 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 1576ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1577ms
Finished structural reductions in LTL mode , in 1 iterations and 1659 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLCardinality-03
Stuttering criterion allowed to conclude after 255 steps with 14 reset in 3 ms.
FORMULA ShieldRVs-PT-002A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLCardinality-03 finished in 1955 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(G(p0)))))'
Support contains 1 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-05-30 01:28:30] [INFO ] Invariant cache hit.
[2024-05-30 01:28:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 01:28:30] [INFO ] Invariant cache hit.
[2024-05-30 01:28:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:30] [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-05-30 01:28:31] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
[2024-05-30 01:28:31] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:31] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:28:31] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:28:31] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:31] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:31] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:31] [INFO ] Deduced a trap composed of 7 places in 15 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-05-30 01:28:31] [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 694 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-05-30 01:28:31] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:28:31] [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-05-30 01:28:32] [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 877 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 1581ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1582ms
Finished structural reductions in LTL mode , in 1 iterations and 1653 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLCardinality-06
Product exploration explored 100000 steps with 2501 reset in 189 ms.
Product exploration explored 100000 steps with 2535 reset in 143 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/31 stabilizing places and 1/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 01:28:33] [INFO ] Invariant cache hit.
[2024-05-30 01:28:33] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-30 01:28:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-30 01:28:33] [INFO ] Computed and/alt/rep : 29/130/29 causal constraints (skipped 11 transitions) in 3 ms.
[2024-05-30 01:28:33] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 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-05-30 01:28:33] [INFO ] Invariant cache hit.
[2024-05-30 01:28:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:28:33] [INFO ] Invariant cache hit.
[2024-05-30 01:28:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:33] [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-05-30 01:28:34] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 7 places in 17 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-05-30 01:28:34] [INFO ] Deduced a trap composed of 7 places in 27 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 688 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-05-30 01:28:34] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 8 places in 20 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-05-30 01:28:35] [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 852 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 1555ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1556ms
Finished structural reductions in LTL mode , in 1 iterations and 1627 ms. Remains : 31/31 places, 41/41 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/31 stabilizing places and 1/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 01:28:36] [INFO ] Invariant cache hit.
[2024-05-30 01:28:36] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-30 01:28:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-30 01:28:36] [INFO ] Computed and/alt/rep : 29/130/29 causal constraints (skipped 11 transitions) in 3 ms.
[2024-05-30 01:28:36] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2515 reset in 112 ms.
Product exploration explored 100000 steps with 2514 reset in 230 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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: 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 31 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 16 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:28:37] [INFO ] Redundant transitions in 15 ms returned [13]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 39 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 31 cols
[2024-05-30 01:28:37] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 40/71 variables, 31/79 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 2/84 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:28:37] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 4/88 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 88 constraints, problems are : Problem set: 1 solved, 38 unsolved in 1120 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 1 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 9/38 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/40 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 17/57 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 40/71 variables, 31/88 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 38/126 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 126 constraints, problems are : Problem set: 1 solved, 38 unsolved in 496 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 38/39 constraints, Known Traps: 17/17 constraints]
After SMT, in 1626ms problems are : Problem set: 1 solved, 38 unsolved
Search for dead transitions found 1 dead transitions in 1627ms
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 : 31/31 places, 39/41 transitions.
Graph (complete) has 136 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 30 /31 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/31 places, 39/41 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1669 ms. Remains : 30/31 places, 39/41 transitions.
Built C files in :
/tmp/ltsmin10591100850139439100
[2024-05-30 01:28:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10591100850139439100
Running compilation step : cd /tmp/ltsmin10591100850139439100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 262 ms.
Running link step : cd /tmp/ltsmin10591100850139439100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10591100850139439100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8862122568751432106.hoa' '--buchi-type=spotba'
LTSmin run took 293 ms.
FORMULA ShieldRVs-PT-002A-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-002A-LTLCardinality-06 finished in 8505 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))) U G(((p2||G(p1)) U p0))))'
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.
// Phase 1: matrix 41 rows 31 cols
[2024-05-30 01:28:39] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:28:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 01:28:39] [INFO ] Invariant cache hit.
[2024-05-30 01:28:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:39] [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-05-30 01:28:39] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:28:39] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:39] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:28:39] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:28:39] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:28:39] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:39] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:39] [INFO ] Deduced a trap composed of 7 places in 21 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-05-30 01:28:39] [INFO ] Deduced a trap composed of 7 places in 23 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 683 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-05-30 01:28:40] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:40] [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-05-30 01:28:40] [INFO ] Deduced a trap composed of 7 places in 28 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 886 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 1578ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1580ms
Finished structural reductions in LTL mode , in 1 iterations and 1669 ms. Remains : 31/31 places, 41/41 transitions.
Stuttering acceptance computed with spot in 649 ms :[(NOT p0), p1, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), true, (NOT p1), false, (AND (NOT p0) (NOT p1)), false, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-002A-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002A-LTLCardinality-08 finished in 2354 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 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-05-30 01:28:41] [INFO ] Invariant cache hit.
[2024-05-30 01:28:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:28:41] [INFO ] Invariant cache hit.
[2024-05-30 01:28:41] [INFO ] Implicit Places using invariants and state equation in 40 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-05-30 01:28:41] [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-05-30 01:28:41] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 7 places in 20 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-05-30 01:28:42] [INFO ] Deduced a trap composed of 7 places in 27 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 731 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-05-30 01:28:42] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:28:42] [INFO ] Deduced a trap composed of 8 places in 27 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-05-30 01:28:43] [INFO ] Deduced a trap composed of 7 places in 28 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 875 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 1618ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1618ms
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 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002A-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Product exploration explored 100000 steps with 50000 reset in 157 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 : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002A-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002A-LTLCardinality-10 finished in 2215 ms.
All properties solved by simple procedures.
Total runtime 22630 ms.

BK_STOP 1717032524000

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVs-PT-002A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761700723"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;