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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 34K 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 ShieldIIPt-PT-002B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-002B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717235325120

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:48:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:48:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:48:46] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-06-01 09:48:46] [INFO ] Transformed 143 places.
[2024-06-01 09:48:46] [INFO ] Transformed 133 transitions.
[2024-06-01 09:48:46] [INFO ] Found NUPN structural information;
[2024-06-01 09:48:46] [INFO ] Parsed PT model containing 143 places and 133 transitions and 330 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-002B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 133/133 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 128 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 128 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 127 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 127 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 126 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 126 transition count 116
Applied a total of 34 rules in 40 ms. Remains 126 /143 variables (removed 17) and now considering 116/133 (removed 17) transitions.
// Phase 1: matrix 116 rows 126 cols
[2024-06-01 09:48:46] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 09:48:46] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 09:48:46] [INFO ] Invariant cache hit.
[2024-06-01 09:48:46] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-06-01 09:48:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:47] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 13 ms to minimize.
[2024-06-01 09:48:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:48] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/242 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/242 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
[2024-06-01 09:48:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 171 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6764 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:54] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:48:54] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:48:54] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:48:54] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/242 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 115/290 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:48:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2024-06-01 09:48:55] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 09:48:56] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:48:56] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 295 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5868 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 35/35 constraints]
After SMT, in 12674ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 12692ms
Starting structural reductions in LTL mode, iteration 1 : 126/143 places, 116/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13115 ms. Remains : 126/143 places, 116/133 transitions.
Support contains 30 out of 126 places after structural reductions.
[2024-06-01 09:48:59] [INFO ] Flatten gal took : 26 ms
[2024-06-01 09:48:59] [INFO ] Flatten gal took : 14 ms
[2024-06-01 09:48:59] [INFO ] Input system was already deterministic with 116 transitions.
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 17253 steps (4 resets) in 309 ms. (55 steps per ms) remains 0/17 properties
Computed a total of 32 stabilizing places and 32 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F((p1&&(F(G(p3))||p2))))||p0))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 125 transition count 93
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 103 transition count 93
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 44 place count 103 transition count 80
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 70 place count 90 transition count 80
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 85 transition count 75
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 85 transition count 75
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 80 place count 85 transition count 70
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 80 transition count 70
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 150 place count 50 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 50 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 49 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 163 place count 44 transition count 41
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 44 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 168 place count 40 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 168 place count 40 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 39 transition count 38
Applied a total of 170 rules in 34 ms. Remains 39 /126 variables (removed 87) and now considering 38/116 (removed 78) transitions.
// Phase 1: matrix 38 rows 39 cols
[2024-06-01 09:49:00] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 09:49:00] [INFO ] Implicit Places using invariants in 37 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/126 places, 38/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 37
Applied a total of 2 rules in 4 ms. Remains 37 /38 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 37 cols
[2024-06-01 09:49:00] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 09:49:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 09:49:00] [INFO ] Invariant cache hit.
[2024-06-01 09:49:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/126 places, 37/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 37/126 places, 37/116 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-002B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-05 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||p0))&&(F(p3)||p2)))))'
Support contains 8 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 110
Applied a total of 12 rules in 9 ms. Remains 120 /126 variables (removed 6) and now considering 110/116 (removed 6) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-06-01 09:49:00] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 09:49:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 09:49:00] [INFO ] Invariant cache hit.
[2024-06-01 09:49:00] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-06-01 09:49:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:49:02] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:49:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:49:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:49:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/230 variables, 120/155 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 155 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3139 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/230 variables, 120/155 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 109/264 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:49:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:49:05] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:49:05] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:49:05] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
[2024-06-01 09:49:05] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:49:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:49:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:49:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:49:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:49:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:49:06] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 7/278 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:08] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:49:08] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:09] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:10] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/230 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 283 constraints, problems are : Problem set: 0 solved, 109 unsolved in 11935 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 35/35 constraints]
After SMT, in 15089ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 15091ms
Starting structural reductions in LTL mode, iteration 1 : 120/126 places, 110/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15248 ms. Remains : 120/126 places, 110/116 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-06
Product exploration explored 100000 steps with 1 reset in 293 ms.
Product exploration explored 100000 steps with 8 reset in 289 ms.
Computed a total of 31 stabilizing places and 31 stable transitions
Computed a total of 31 stabilizing places and 31 stable transitions
Detected a total of 31/120 stabilizing places and 31/110 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (NOT p2)), (X p3), (X p0), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2024-06-01 09:49:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/120 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 110/230 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 88/230 variables, and 15 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, State Equation: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (NOT p2)), (X p3), (X p0), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 365 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 110/110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 120 transition count 91
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 101 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 100 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 40 place count 100 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 74 place count 83 transition count 73
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 126 place count 57 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 57 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 56 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 139 place count 51 transition count 48
Applied a total of 139 rules in 17 ms. Remains 51 /120 variables (removed 69) and now considering 48/110 (removed 62) transitions.
// Phase 1: matrix 48 rows 51 cols
[2024-06-01 09:49:18] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:49:18] [INFO ] Implicit Places using invariants in 40 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/120 places, 48/110 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 50 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 47
Applied a total of 2 rules in 3 ms. Remains 49 /50 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 49 cols
[2024-06-01 09:49:18] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 09:49:18] [INFO ] Implicit Places using invariants in 45 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/120 places, 47/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 107 ms. Remains : 48/120 places, 47/110 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Detected a total of 12/48 stabilizing places and 11/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 369 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17 reset in 252 ms.
Product exploration explored 100000 steps with 17 reset in 305 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 47/47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 43 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 42 transition count 41
Applied a total of 9 rules in 4 ms. Remains 42 /48 variables (removed 6) and now considering 41/47 (removed 6) transitions.
// Phase 1: matrix 41 rows 42 cols
[2024-06-01 09:49:19] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 09:49:19] [INFO ] Implicit Places using invariants in 35 ms returned [34]
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 : 41/48 places, 41/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 41/48 places, 41/47 transitions.
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-06 finished in 18877 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 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 109
Applied a total of 14 rules in 3 ms. Remains 119 /126 variables (removed 7) and now considering 109/116 (removed 7) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-06-01 09:49:19] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 09:49:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 09:49:19] [INFO ] Invariant cache hit.
[2024-06-01 09:49:19] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 09:49:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:49:20] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:49:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:21] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:21] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3409 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 108/264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:24] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:49:24] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:49:24] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:49:24] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:49:24] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:49:24] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:49:25] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:27] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:49:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/228 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:27] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:28] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 276 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8444 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 30/30 constraints]
After SMT, in 11864ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11865ms
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 109/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11989 ms. Remains : 119/126 places, 109/116 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-07
Product exploration explored 100000 steps with 13836 reset in 102 ms.
Product exploration explored 100000 steps with 13832 reset in 72 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/119 stabilizing places and 30/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:49:32] [INFO ] Invariant cache hit.
[2024-06-01 09:49:32] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 09:49:32] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 09:49:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:49:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 09:49:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 09:49:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:49:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:49:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-06-01 09:49:32] [INFO ] Computed and/alt/rep : 108/163/108 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 09:49:32] [INFO ] Added : 85 causal constraints over 17 iterations in 158 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 118 transition count 86
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 96 transition count 86
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 44 place count 96 transition count 69
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 78 place count 79 transition count 69
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 140 place count 48 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 48 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 47 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 153 place count 42 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 40 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 38 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 38 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 37 transition count 36
Applied a total of 159 rules in 13 ms. Remains 37 /119 variables (removed 82) and now considering 36/109 (removed 73) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-06-01 09:49:32] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 09:49:32] [INFO ] Implicit Places using invariants in 32 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/119 places, 36/109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 35
Applied a total of 2 rules in 3 ms. Remains 35 /36 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 35 cols
[2024-06-01 09:49:32] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 09:49:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 09:49:32] [INFO ] Invariant cache hit.
[2024-06-01 09:49:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 09:49:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/119 places, 35/109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 35/119 places, 35/109 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/35 stabilizing places and 2/35 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:49:33] [INFO ] Invariant cache hit.
[2024-06-01 09:49:33] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 09:49:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 09:49:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:49:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 09:49:33] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 09:49:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 09:49:33] [INFO ] [Nat]Added 9 Read/Feed constraints in 0 ms returned sat
[2024-06-01 09:49:33] [INFO ] Computed and/alt/rep : 30/103/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 09:49:33] [INFO ] Added : 14 causal constraints over 4 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-07 finished in 14069 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)||(p1 U p2)))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 125 transition count 95
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 105 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 103 transition count 93
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 44 place count 103 transition count 80
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 70 place count 90 transition count 80
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 86 transition count 76
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 86 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 78 place count 86 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 86 place count 82 transition count 72
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 152 place count 49 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 49 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 48 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 163 place count 44 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 42 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 40 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 167 place count 40 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 39 transition count 35
Applied a total of 169 rules in 18 ms. Remains 39 /126 variables (removed 87) and now considering 35/116 (removed 81) transitions.
// Phase 1: matrix 35 rows 39 cols
[2024-06-01 09:49:33] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 09:49:33] [INFO ] Implicit Places using invariants in 36 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/126 places, 35/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 34
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 34/35 (removed 1) transitions.
// Phase 1: matrix 34 rows 37 cols
[2024-06-01 09:49:33] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 09:49:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 09:49:33] [INFO ] Invariant cache hit.
[2024-06-01 09:49:33] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/126 places, 34/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 37/126 places, 34/116 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-08 finished in 245 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 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 110
Applied a total of 12 rules in 5 ms. Remains 120 /126 variables (removed 6) and now considering 110/116 (removed 6) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-06-01 09:49:34] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:49:34] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 09:49:34] [INFO ] Invariant cache hit.
[2024-06-01 09:49:34] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-06-01 09:49:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:34] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:49:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:49:34] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:49:34] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:49:34] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:49:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:49:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:35] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:36] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/230 variables, 120/156 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 156 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3299 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/230 variables, 120/156 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 109/265 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:49:38] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:49:38] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:49:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:39] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:39] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:49:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:49:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:49:39] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/230 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 276 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8517 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 28/28 constraints]
After SMT, in 11825ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 11827ms
Starting structural reductions in LTL mode, iteration 1 : 120/126 places, 110/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11945 ms. Remains : 120/126 places, 110/116 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-002B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-10 finished in 12273 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(((p1||X(p2))&&p0))))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 110
Applied a total of 12 rules in 3 ms. Remains 120 /126 variables (removed 6) and now considering 110/116 (removed 6) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-06-01 09:49:46] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:49:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 09:49:46] [INFO ] Invariant cache hit.
[2024-06-01 09:49:46] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-06-01 09:49:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:46] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:49:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:49:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/230 variables, 120/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:48] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 158 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3514 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/230 variables, 120/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 109/267 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:50] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:49:50] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:49:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:49:50] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 7/274 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 09:49:52] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 275 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4669 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 27/27 constraints]
After SMT, in 8192ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 8193ms
Starting structural reductions in LTL mode, iteration 1 : 120/126 places, 110/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8313 ms. Remains : 120/126 places, 110/116 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-11
Product exploration explored 100000 steps with 110 reset in 134 ms.
Stack based approach found an accepted trace after 1530 steps with 1 reset with depth 290 and stack size 290 in 2 ms.
FORMULA ShieldIIPt-PT-002B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-11 finished in 8587 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 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 109
Applied a total of 14 rules in 2 ms. Remains 119 /126 variables (removed 7) and now considering 109/116 (removed 7) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-06-01 09:49:54] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:49:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 09:49:54] [INFO ] Invariant cache hit.
[2024-06-01 09:49:55] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 09:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:49:55] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3293 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 108/264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:49:59] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:49:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:49:59] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:49:59] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:49:59] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:49:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:50:02] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:50:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/228 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:50:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 09:50:03] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 276 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8172 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 30/30 constraints]
After SMT, in 11478ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11480ms
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 109/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11623 ms. Remains : 119/126 places, 109/116 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-002B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-12 finished in 11851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p1))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 111
Applied a total of 10 rules in 3 ms. Remains 121 /126 variables (removed 5) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 121 cols
[2024-06-01 09:50:06] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:50:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 09:50:06] [INFO ] Invariant cache hit.
[2024-06-01 09:50:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-06-01 09:50:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:50:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:50:08] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/232 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:50:09] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:50:09] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/232 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 163 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4652 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:12] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:50:12] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:50:12] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:50:12] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 111/232 variables, 121/168 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 110/278 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:50:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/232 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 288 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7050 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 38/38 constraints]
After SMT, in 11710ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 11712ms
Starting structural reductions in LTL mode, iteration 1 : 121/126 places, 111/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11835 ms. Remains : 121/126 places, 111/116 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-15
Product exploration explored 100000 steps with 2752 reset in 97 ms.
Product exploration explored 100000 steps with 2720 reset in 108 ms.
Computed a total of 31 stabilizing places and 31 stable transitions
Computed a total of 31 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 149 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 09:50:19] [INFO ] Invariant cache hit.
[2024-06-01 09:50:19] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 09:50:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-01 09:50:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:50:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 09:50:19] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-01 09:50:19] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:50:19] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:50:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-06-01 09:50:19] [INFO ] Computed and/alt/rep : 110/166/110 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 09:50:19] [INFO ] Added : 107 causal constraints over 22 iterations in 207 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-06-01 09:50:19] [INFO ] Invariant cache hit.
[2024-06-01 09:50:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:50:20] [INFO ] Invariant cache hit.
[2024-06-01 09:50:20] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-06-01 09:50:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:50:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/232 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:50:22] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:50:22] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:23] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/232 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 163 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4701 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:50:25] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:50:25] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:50:25] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 111/232 variables, 121/168 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 110/278 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:50:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:27] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 09:50:28] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/232 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 288 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7012 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 38/38 constraints]
After SMT, in 11723ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 11724ms
Finished structural reductions in LTL mode , in 1 iterations and 11828 ms. Remains : 121/121 places, 111/111 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Computed a total of 31 stabilizing places and 31 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 142 steps (0 resets) in 4 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 09:50:32] [INFO ] Invariant cache hit.
[2024-06-01 09:50:32] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 09:50:32] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-01 09:50:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:50:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 09:50:32] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-01 09:50:32] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:50:32] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:50:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-06-01 09:50:32] [INFO ] Computed and/alt/rep : 110/166/110 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 09:50:32] [INFO ] Added : 107 causal constraints over 22 iterations in 205 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2745 reset in 100 ms.
Stack based approach found an accepted trace after 6083 steps with 168 reset with depth 44 and stack size 44 in 6 ms.
FORMULA ShieldIIPt-PT-002B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-15 finished in 26331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||p0))&&(F(p3)||p2)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-002B-LTLCardinality-06
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 126 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 126 transition count 97
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 107 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 106 transition count 96
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 40 place count 106 transition count 82
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 68 place count 92 transition count 82
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 88 transition count 78
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 88 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 76 place count 88 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 84 transition count 74
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 138 place count 57 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 57 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 56 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 151 place count 51 transition count 48
Applied a total of 151 rules in 14 ms. Remains 51 /126 variables (removed 75) and now considering 48/116 (removed 68) transitions.
// Phase 1: matrix 48 rows 51 cols
[2024-06-01 09:50:33] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:50:33] [INFO ] Implicit Places using invariants in 33 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 50/126 places, 48/116 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 50 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 47
Applied a total of 2 rules in 2 ms. Remains 49 /50 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 49 cols
[2024-06-01 09:50:33] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 09:50:33] [INFO ] Implicit Places using invariants in 32 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 48/126 places, 47/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 90 ms. Remains : 48/126 places, 47/116 transitions.
Running random walk in product with property : ShieldIIPt-PT-002B-LTLCardinality-06
Product exploration explored 100000 steps with 34 reset in 148 ms.
Product exploration explored 100000 steps with 23 reset in 186 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Detected a total of 12/48 stabilizing places and 11/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (NOT p2)), (X p3), (X p0), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9 resets) in 115 ms. (344 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
// Phase 1: matrix 47 rows 48 cols
[2024-06-01 09:50:34] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 09:50:34] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/48 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/94 variables, 48/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/95 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 48/48 constraints, ReadFeed: 15/15 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 41/95 variables, and 14 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, State Equation: 0/48 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (NOT p2)), (X p3), (X p0), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 10 factoid took 428 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 47/47 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-01 09:50:34] [INFO ] Invariant cache hit.
[2024-06-01 09:50:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 09:50:35] [INFO ] Invariant cache hit.
[2024-06-01 09:50:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 09:50:35] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 09:50:35] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 09:50:35] [INFO ] Invariant cache hit.
[2024-06-01 09:50:35] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 09:50:35] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 46/94 variables, 48/74 constraints. Problems are: Problem set: 0 solved, 46 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/95 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 89 constraints, problems are : Problem set: 0 solved, 46 unsolved in 981 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 48/48 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 46/94 variables, 48/74 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 46/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/95 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 135 constraints, problems are : Problem set: 0 solved, 46 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 48/48 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 9/9 constraints]
After SMT, in 1898ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1898ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1996 ms. Remains : 48/48 places, 47/47 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Detected a total of 12/48 stabilizing places and 11/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3379 steps (1 resets) in 20 ms. (160 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 38 reset in 148 ms.
Product exploration explored 100000 steps with 27 reset in 154 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 47/47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 43 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 42 transition count 41
Applied a total of 9 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 41/47 (removed 6) transitions.
// Phase 1: matrix 41 rows 42 cols
[2024-06-01 09:50:38] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 09:50:38] [INFO ] Implicit Places using invariants in 39 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 41/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43 ms. Remains : 41/48 places, 41/47 transitions.
Treatment of property ShieldIIPt-PT-002B-LTLCardinality-06 finished in 5104 ms.
[2024-06-01 09:50:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:50:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 09:50:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 116 transitions and 296 arcs took 3 ms.
Total runtime 111917 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPt-PT-002B-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717235479230

--------------------
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 ShieldIIPt-PT-002B-LTLCardinality-06
ltl formula formula --ltl=/tmp/2241/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 126 places, 116 transitions and 296 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 128 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 127, there are 158 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): ~37 levels ~10000 states ~18236 transitions
pnml2lts-mc( 0/ 4): ~37 levels ~20000 states ~38996 transitions
pnml2lts-mc( 0/ 4): ~37 levels ~40000 states ~82144 transitions
pnml2lts-mc( 0/ 4): ~1053 levels ~80000 states ~180136 transitions
pnml2lts-mc( 3/ 4): ~36 levels ~160000 states ~509244 transitions
pnml2lts-mc( 3/ 4): ~36 levels ~320000 states ~1117380 transitions
pnml2lts-mc( 3/ 4): ~34722 levels ~640000 states ~2502144 transitions
pnml2lts-mc( 2/ 4): ~196447 levels ~1280000 states ~5934984 transitions
pnml2lts-mc( 1/ 4): ~142770 levels ~2560000 states ~13914564 transitions
pnml2lts-mc( 1/ 4): ~236021 levels ~5120000 states ~29383144 transitions
pnml2lts-mc( 1/ 4): ~259184 levels ~10240000 states ~61002624 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2103150
pnml2lts-mc( 0/ 4): unique states count: 13260550
pnml2lts-mc( 0/ 4): unique transitions count: 82940808
pnml2lts-mc( 0/ 4): - self-loop count: 21
pnml2lts-mc( 0/ 4): - claim dead count: 12234600
pnml2lts-mc( 0/ 4): - claim found count: 31092742
pnml2lts-mc( 0/ 4): - claim success count: 13260594
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9013061
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13260605 states 82941036 transitions, fanout: 6.255
pnml2lts-mc( 0/ 4): Total exploration time 40.530 sec (40.500 sec minimum, 40.515 sec on average)
pnml2lts-mc( 0/ 4): States per second: 327180, Transitions per second: 2046411
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 264.1MB, 8.3 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/12.0%
pnml2lts-mc( 0/ 4): Stored 116 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 264.1MB (~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="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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-171683760600203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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