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-171683760200011.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 ShieldIIPs-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760200011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-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 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 17K 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 ShieldIIPs-PT-001B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-001B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717223183228

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:26:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:26:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:26:24] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-06-01 06:26:24] [INFO ] Transformed 63 places.
[2024-06-01 06:26:24] [INFO ] Transformed 62 transitions.
[2024-06-01 06:26:24] [INFO ] Found NUPN structural information;
[2024-06-01 06:26:24] [INFO ] Parsed PT model containing 63 places and 62 transitions and 184 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 61
Applied a total of 2 rules in 22 ms. Remains 62 /63 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 62 cols
[2024-06-01 06:26:24] [INFO ] Computed 10 invariants in 7 ms
[2024-06-01 06:26:24] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 06:26:24] [INFO ] Invariant cache hit.
[2024-06-01 06:26:25] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 06:26:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 9 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 12 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 4 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 8 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 6 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/123 variables, 62/108 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 2 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:26:27] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:28] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:28] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:26:28] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:26:28] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 119 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4002 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:29] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:26:29] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:26:29] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:29] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/123 variables, 62/124 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 60/184 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 06:26:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:26:30] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/123 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 186 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2499 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 54/54 constraints]
After SMT, in 6546ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6559ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6882 ms. Remains : 62/63 places, 61/62 transitions.
Support contains 25 out of 62 places after structural reductions.
[2024-06-01 06:26:31] [INFO ] Flatten gal took : 29 ms
[2024-06-01 06:26:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:26:31] [INFO ] Input system was already deterministic with 61 transitions.
RANDOM walk for 785 steps (0 resets) in 86 ms. (9 steps per ms) remains 0/20 properties
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Applied a total of 12 rules in 4 ms. Remains 56 /62 variables (removed 6) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-06-01 06:26:32] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:26:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 06:26:32] [INFO ] Invariant cache hit.
[2024-06-01 06:26:32] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 06:26:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:32] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 4 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:34] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/111 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 80 constraints, problems are : Problem set: 0 solved, 54 unsolved in 4624 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 55/111 variables, 56/85 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 54/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/111 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/111 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 144 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2406 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 24/24 constraints]
After SMT, in 7068ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 7075ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 55/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7185 ms. Remains : 56/62 places, 55/61 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-00 finished in 7456 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)||F(G(p1))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 54
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 54
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 55 transition count 48
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 49 transition count 48
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 44 transition count 43
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 34 place count 44 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 42 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 27 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 26 transition count 26
Applied a total of 68 rules in 23 ms. Remains 26 /62 variables (removed 36) and now considering 26/61 (removed 35) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-06-01 06:26:39] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 06:26:39] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 06:26:39] [INFO ] Invariant cache hit.
[2024-06-01 06:26:40] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-06-01 06:26:40] [INFO ] Redundant transitions in 43 ms returned []
Running 25 sub problems to find dead transitions.
[2024-06-01 06:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/52 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 38 constraints, problems are : Problem set: 0 solved, 25 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/52 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 25/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 66 constraints, problems are : Problem set: 0 solved, 25 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 6/6 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 798ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/62 places, 26/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1074 ms. Remains : 26/62 places, 26/61 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-01
Product exploration explored 100000 steps with 313 reset in 359 ms.
Stack based approach found an accepted trace after 187 steps with 1 reset with depth 24 and stack size 24 in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-01 finished in 1521 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(((X(!p0)&&F(p1))||G(!p0))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Applied a total of 10 rules in 3 ms. Remains 57 /62 variables (removed 5) and now considering 56/61 (removed 5) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-06-01 06:26:41] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 06:26:41] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 06:26:41] [INFO ] Invariant cache hit.
[2024-06-01 06:26:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 06:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/113 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 85 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2144 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:26:44] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:26:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:26:44] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 150 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 28/28 constraints]
After SMT, in 4193ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4195ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 56/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4287 ms. Remains : 57/62 places, 56/61 transitions.
Stuttering acceptance computed with spot in 139 ms :[p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-02
Product exploration explored 100000 steps with 4785 reset in 114 ms.
Product exploration explored 100000 steps with 4842 reset in 136 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
RANDOM walk for 781 steps (0 resets) in 26 ms. (28 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 302 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 190 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
[2024-06-01 06:26:47] [INFO ] Invariant cache hit.
[2024-06-01 06:26:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:26:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 06:26:47] [INFO ] Computed and/alt/rep : 55/121/55 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 06:26:47] [INFO ] Added : 55 causal constraints over 11 iterations in 86 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 54 transition count 53
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 54 transition count 46
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 47 transition count 46
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 50 place count 31 transition count 30
Applied a total of 50 rules in 8 ms. Remains 31 /57 variables (removed 26) and now considering 30/56 (removed 26) transitions.
// Phase 1: matrix 30 rows 31 cols
[2024-06-01 06:26:47] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 06:26:47] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/57 places, 30/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 30/57 places, 30/56 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
RANDOM walk for 113 steps (0 resets) in 10 ms. (10 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 254 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 207 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
// Phase 1: matrix 30 rows 30 cols
[2024-06-01 06:26:48] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 06:26:48] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 06:26:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:48] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 06:26:48] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:26:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-06-01 06:26:48] [INFO ] Computed and/alt/rep : 29/90/29 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:26:48] [INFO ] Added : 20 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 209 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
Product exploration explored 100000 steps with 19566 reset in 78 ms.
Product exploration explored 100000 steps with 19491 reset in 80 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 06:26:48] [INFO ] Invariant cache hit.
[2024-06-01 06:26:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 06:26:48] [INFO ] Invariant cache hit.
[2024-06-01 06:26:48] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 06:26:48] [INFO ] Redundant transitions in 31 ms returned [29]
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 28 sub problems to find dead transitions.
// Phase 1: matrix 29 rows 30 cols
[2024-06-01 06:26:48] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/59 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 44 constraints, problems are : Problem set: 0 solved, 28 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 29/59 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 28/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 72 constraints, problems are : Problem set: 0 solved, 28 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 5/5 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 29/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 811 ms. Remains : 30/30 places, 29/30 transitions.
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-02 finished in 8375 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(F(p0))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 57
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 56
Applied a total of 10 rules in 9 ms. Remains 57 /62 variables (removed 5) and now considering 56/61 (removed 5) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-06-01 06:26:49] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:26:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 06:26:49] [INFO ] Invariant cache hit.
[2024-06-01 06:26:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 06:26:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 56/113 variables, 57/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/113 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/113 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 86 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 56/113 variables, 57/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/113 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 13 (OVERLAPS) 0/113 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 151 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2843 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 29/29 constraints]
After SMT, in 5011ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 5012ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 56/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5102 ms. Remains : 57/62 places, 56/61 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-05
Product exploration explored 100000 steps with 2655 reset in 83 ms.
Product exploration explored 100000 steps with 2678 reset in 108 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 158 steps (0 resets) in 4 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 06:26:55] [INFO ] Invariant cache hit.
[2024-06-01 06:26:55] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:26:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 06:26:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:26:55] [INFO ] Computed and/alt/rep : 55/121/55 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:26:55] [INFO ] Added : 52 causal constraints over 11 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 06:26:55] [INFO ] Invariant cache hit.
[2024-06-01 06:26:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 06:26:55] [INFO ] Invariant cache hit.
[2024-06-01 06:26:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 06:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 56/113 variables, 57/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/113 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/113 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 86 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 56/113 variables, 57/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:26:59] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:26:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/113 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 13 (OVERLAPS) 0/113 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 151 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 29/29 constraints]
After SMT, in 4844ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4846ms
Finished structural reductions in LTL mode , in 1 iterations and 4929 ms. Remains : 57/57 places, 56/56 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 131 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 06:27:01] [INFO ] Invariant cache hit.
[2024-06-01 06:27:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 06:27:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:27:01] [INFO ] Computed and/alt/rep : 55/121/55 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:27:01] [INFO ] Added : 52 causal constraints over 11 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2658 reset in 78 ms.
Stack based approach found an accepted trace after 28020 steps with 749 reset with depth 64 and stack size 64 in 30 ms.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-05 finished in 12029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p2)||p1))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 57
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 56
Applied a total of 10 rules in 7 ms. Remains 57 /62 variables (removed 5) and now considering 56/61 (removed 5) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-06-01 06:27:01] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:27:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:27:01] [INFO ] Invariant cache hit.
[2024-06-01 06:27:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 06:27:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 56/113 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/113 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/113 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 16 (OVERLAPS) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 84 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2604 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 56/113 variables, 57/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/113 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 147 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2338 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 25/25 constraints]
After SMT, in 4951ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4952ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 56/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5044 ms. Remains : 57/62 places, 56/61 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 49 ms.
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 19 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-001B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-06 finished in 5446 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 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Applied a total of 12 rules in 4 ms. Remains 56 /62 variables (removed 6) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-06-01 06:27:07] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:27:07] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 06:27:07] [INFO ] Invariant cache hit.
[2024-06-01 06:27:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 06:27:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 83 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 147 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2115 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 27/27 constraints]
After SMT, in 3806ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3807ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 55/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3894 ms. Remains : 56/62 places, 55/61 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-08
Stuttering criterion allowed to conclude after 69922 steps with 1178 reset in 63 ms.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-08 finished in 4054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 54
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 55 transition count 49
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 44 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 34 place count 44 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 42 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 27 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 26 transition count 26
Applied a total of 68 rules in 13 ms. Remains 26 /62 variables (removed 36) and now considering 26/61 (removed 35) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-06-01 06:27:11] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 06:27:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 06:27:11] [INFO ] Invariant cache hit.
[2024-06-01 06:27:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 06:27:11] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-06-01 06:27:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/52 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 25 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 26/52 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 25/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 63 constraints, problems are : Problem set: 0 solved, 25 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/62 places, 26/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 564 ms. Remains : 26/62 places, 26/61 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-10
Product exploration explored 100000 steps with 276 reset in 82 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-10 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Applied a total of 12 rules in 7 ms. Remains 56 /62 variables (removed 6) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-06-01 06:27:11] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:27:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 06:27:11] [INFO ] Invariant cache hit.
[2024-06-01 06:27:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 06:27:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/111 variables, 56/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 91 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2064 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 148 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 28/28 constraints]
After SMT, in 3717ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3718ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 55/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3803 ms. Remains : 56/62 places, 55/61 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-12 finished in 3958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(G(!p1)))) U X(p2)))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Applied a total of 12 rules in 4 ms. Remains 56 /62 variables (removed 6) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-06-01 06:27:15] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:27:15] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 06:27:15] [INFO ] Invariant cache hit.
[2024-06-01 06:27:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 06:27:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/111 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/111 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/111 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 82 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:18] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:18] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:18] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 06:27:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 141 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 21/21 constraints]
After SMT, in 3857ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3859ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 55/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3961 ms. Remains : 56/62 places, 55/61 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND p1 (NOT p2)), p1, true, p1, p1]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 22 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-001B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-13 finished in 4490 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)&&F(p1))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 55
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 54
Applied a total of 14 rules in 7 ms. Remains 55 /62 variables (removed 7) and now considering 54/61 (removed 7) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-06-01 06:27:20] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:27:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 06:27:20] [INFO ] Invariant cache hit.
[2024-06-01 06:27:20] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-06-01 06:27:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2185 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3703ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3704ms
Starting structural reductions in LTL mode, iteration 1 : 55/62 places, 54/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3796 ms. Remains : 55/62 places, 54/61 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-14 finished in 3977 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((X(F(p0))||G(p1))))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 55
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 54
Applied a total of 14 rules in 7 ms. Remains 55 /62 variables (removed 7) and now considering 54/61 (removed 7) transitions.
[2024-06-01 06:27:24] [INFO ] Invariant cache hit.
[2024-06-01 06:27:24] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 06:27:24] [INFO ] Invariant cache hit.
[2024-06-01 06:27:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-06-01 06:27:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3669ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3670ms
Starting structural reductions in LTL mode, iteration 1 : 55/62 places, 54/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3756 ms. Remains : 55/62 places, 54/61 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-15
Product exploration explored 100000 steps with 20000 reset in 49 ms.
Product exploration explored 100000 steps with 20000 reset in 54 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9 resets) in 355 ms. (112 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (12 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2024-06-01 06:27:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 23/109 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 2/10 constraints, State Equation: 0/55 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 06:27:29] [INFO ] Invariant cache hit.
[2024-06-01 06:27:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 06:27:29] [INFO ] Invariant cache hit.
[2024-06-01 06:27:29] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-06-01 06:27:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3583ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3585ms
Finished structural reductions in LTL mode , in 1 iterations and 3661 ms. Remains : 55/55 places, 54/54 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 62 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20000 reset in 51 ms.
Product exploration explored 100000 steps with 20000 reset in 59 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 54/54 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 55 transition count 54
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 55 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 55 transition count 56
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 27 place count 55 transition count 56
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 49 transition count 50
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 49 transition count 50
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 39 rules in 14 ms. Remains 49 /55 variables (removed 6) and now considering 50/54 (removed 4) transitions.
[2024-06-01 06:27:34] [INFO ] Redundant transitions in 12 ms returned [49]
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 48 sub problems to find dead transitions.
// Phase 1: matrix 49 rows 49 cols
[2024-06-01 06:27:34] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:27:34] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 9/19 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 49/98 variables, 49/68 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 3/71 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/71 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/71 constraints. Problems are: Problem set: 23 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 71 constraints, problems are : Problem set: 23 solved, 25 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 23 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 22/49 variables, 10/10 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 9/19 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 49/98 variables, 49/68 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 3/71 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 25/96 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/96 constraints. Problems are: Problem set: 23 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/96 constraints. Problems are: Problem set: 23 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 96 constraints, problems are : Problem set: 23 solved, 25 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 25/48 constraints, Known Traps: 9/9 constraints]
After SMT, in 988ms problems are : Problem set: 23 solved, 25 unsolved
Search for dead transitions found 23 dead transitions in 989ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/55 places, 26/54 transitions.
Graph (complete) has 88 edges and 49 vertex of which 28 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 28 /49 variables (removed 21) and now considering 26/26 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/55 places, 26/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1031 ms. Remains : 28/55 places, 26/54 transitions.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-06-01 06:27:35] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 06:27:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 06:27:35] [INFO ] Invariant cache hit.
[2024-06-01 06:27:35] [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 53 sub problems to find dead transitions.
[2024-06-01 06:27:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2121 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3650ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3651ms
Finished structural reductions in LTL mode , in 1 iterations and 3732 ms. Remains : 55/55 places, 54/54 transitions.
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-15 finished in 15236 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(((X(!p0)&&F(p1))||G(!p0))))'
Found a Shortening insensitive property : ShieldIIPs-PT-001B-LTLCardinality-02
Stuttering acceptance computed with spot in 134 ms :[p0, p0, (AND (NOT p1) p0)]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 59 transition count 58
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 59 transition count 51
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 52 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 47 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 47 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 47 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 46 transition count 45
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 31 transition count 30
Applied a total of 60 rules in 14 ms. Remains 31 /62 variables (removed 31) and now considering 30/61 (removed 31) transitions.
// Phase 1: matrix 30 rows 31 cols
[2024-06-01 06:27:39] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 06:27:39] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 30/62 places, 30/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 48 ms. Remains : 30/62 places, 30/61 transitions.
Running random walk in product with property : ShieldIIPs-PT-001B-LTLCardinality-02
Product exploration explored 100000 steps with 19448 reset in 58 ms.
Product exploration explored 100000 steps with 19569 reset in 65 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
RANDOM walk for 337 steps (1 resets) in 7 ms. (42 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 244 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 182 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
// Phase 1: matrix 30 rows 30 cols
[2024-06-01 06:27:40] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 06:27:40] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:27:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 06:27:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 06:27:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 06:27:41] [INFO ] Computed and/alt/rep : 29/90/29 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 06:27:41] [INFO ] Added : 29 causal constraints over 6 iterations in 28 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 06:27:41] [INFO ] Invariant cache hit.
[2024-06-01 06:27:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 06:27:41] [INFO ] Invariant cache hit.
[2024-06-01 06:27:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 06:27:41] [INFO ] Redundant transitions in 13 ms returned [29]
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 28 sub problems to find dead transitions.
// Phase 1: matrix 29 rows 30 cols
[2024-06-01 06:27:41] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/59 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/59 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 45 constraints, problems are : Problem set: 0 solved, 28 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 29/59 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 28/73 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 74 constraints, problems are : Problem set: 0 solved, 28 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 7/7 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 960ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 29/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1052 ms. Remains : 30/30 places, 29/30 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 99 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
RANDOM walk for 151 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 285 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 210 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
[2024-06-01 06:27:43] [INFO ] Invariant cache hit.
[2024-06-01 06:27:43] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:27:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 06:27:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 06:27:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 06:27:43] [INFO ] Computed and/alt/rep : 28/85/28 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:27:43] [INFO ] Added : 27 causal constraints over 7 iterations in 31 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 280 ms :[p0, p0, (AND p0 (NOT p1)), false, false]
Product exploration explored 100000 steps with 19527 reset in 68 ms.
Product exploration explored 100000 steps with 19513 reset in 73 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-06-01 06:27:43] [INFO ] Invariant cache hit.
[2024-06-01 06:27:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 06:27:43] [INFO ] Invariant cache hit.
[2024-06-01 06:27:43] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-01 06:27:43] [INFO ] Redundant transitions in 12 ms returned []
Running 28 sub problems to find dead transitions.
[2024-06-01 06:27:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/59 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 43 constraints, problems are : Problem set: 0 solved, 28 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 29/59 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/59 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 0/59 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 73 constraints, problems are : Problem set: 0 solved, 28 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 6/6 constraints]
After SMT, in 861ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 861ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 968 ms. Remains : 30/30 places, 29/29 transitions.
Treatment of property ShieldIIPs-PT-001B-LTLCardinality-02 finished in 5044 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((X(F(p0))||G(p1))))))'
[2024-06-01 06:27:44] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:27:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 06:27:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 61 transitions and 182 arcs took 3 ms.
Total runtime 80363 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-001B-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-001B-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717223265107

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-001B-LTLCardinality-02
ltl formula formula --ltl=/tmp/2973/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 62 places, 61 transitions and 182 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2973/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2973/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2973/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2973/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 63 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 63, there are 124 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8220
pnml2lts-mc( 0/ 4): unique states count: 8220
pnml2lts-mc( 0/ 4): unique transitions count: 23099
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 15743
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8870
pnml2lts-mc( 0/ 4): - cum. max stack depth: 173
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8870 states 26493 transitions, fanout: 2.987
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 177400, Transitions per second: 529860
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 8.9 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 61 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-001B-LTLCardinality-15
ltl formula formula --ltl=/tmp/2973/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 62 places, 61 transitions and 182 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2973/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2973/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2973/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2973/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 64 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 63, there are 93 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6
pnml2lts-mc( 0/ 4): unique states count: 6
pnml2lts-mc( 0/ 4): unique transitions count: 5
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 23
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23 states 24 transitions, fanout: 1.043
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 65.3 B/state, compr.: 25.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 61 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-001B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldIIPs-PT-001B, 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 r528-tall-171683760200011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-001B.tgz
mv ShieldIIPs-PT-001B 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 ;