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.r480-tall-171624189700643.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 DES-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189700643
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 08:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 08:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 08:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 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 DES-PT-02b-LTLCardinality-00
FORMULA_NAME DES-PT-02b-LTLCardinality-01
FORMULA_NAME DES-PT-02b-LTLCardinality-02
FORMULA_NAME DES-PT-02b-LTLCardinality-03
FORMULA_NAME DES-PT-02b-LTLCardinality-04
FORMULA_NAME DES-PT-02b-LTLCardinality-05
FORMULA_NAME DES-PT-02b-LTLCardinality-06
FORMULA_NAME DES-PT-02b-LTLCardinality-07
FORMULA_NAME DES-PT-02b-LTLCardinality-08
FORMULA_NAME DES-PT-02b-LTLCardinality-09
FORMULA_NAME DES-PT-02b-LTLCardinality-10
FORMULA_NAME DES-PT-02b-LTLCardinality-11
FORMULA_NAME DES-PT-02b-LTLCardinality-12
FORMULA_NAME DES-PT-02b-LTLCardinality-13
FORMULA_NAME DES-PT-02b-LTLCardinality-14
FORMULA_NAME DES-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717192296737

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:51:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:51:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:51:38] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-31 21:51:38] [INFO ] Transformed 288 places.
[2024-05-31 21:51:38] [INFO ] Transformed 239 transitions.
[2024-05-31 21:51:38] [INFO ] Found NUPN structural information;
[2024-05-31 21:51:38] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-02b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 261 transition count 215
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 261 transition count 215
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 245 transition count 199
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 245 transition count 199
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 95 place count 245 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 244 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 244 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 244 transition count 185
Applied a total of 98 rules in 87 ms. Remains 244 /288 variables (removed 44) and now considering 185/239 (removed 54) transitions.
// Phase 1: matrix 185 rows 244 cols
[2024-05-31 21:51:38] [INFO ] Computed 62 invariants in 29 ms
[2024-05-31 21:51:39] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-31 21:51:39] [INFO ] Invariant cache hit.
[2024-05-31 21:51:39] [INFO ] Implicit Places using invariants and state equation in 282 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 649 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/288 places, 185/239 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 763 ms. Remains : 243/288 places, 185/239 transitions.
Support contains 32 out of 243 places after structural reductions.
[2024-05-31 21:51:39] [INFO ] Flatten gal took : 38 ms
[2024-05-31 21:51:39] [INFO ] Flatten gal took : 15 ms
[2024-05-31 21:51:39] [INFO ] Input system was already deterministic with 185 transitions.
Support contains 30 out of 243 places (down from 32) after GAL structural reductions.
RANDOM walk for 14189 steps (121 resets) in 426 ms. (33 steps per ms) remains 0/18 properties
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 237 transition count 165
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 221 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 221 transition count 153
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 209 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 208 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 208 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 208 transition count 151
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 212 place count 132 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 216 place count 130 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 218 place count 128 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 127 transition count 75
Applied a total of 219 rules in 63 ms. Remains 127 /243 variables (removed 116) and now considering 75/185 (removed 110) transitions.
// Phase 1: matrix 75 rows 127 cols
[2024-05-31 21:51:40] [INFO ] Computed 58 invariants in 7 ms
[2024-05-31 21:51:40] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 21:51:40] [INFO ] Invariant cache hit.
[2024-05-31 21:51:40] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-31 21:51:40] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-31 21:51:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 2/126 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 75/201 variables, 126/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:51:41] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:51:42] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-31 21:51:42] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:51:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:51:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 190 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3485 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 2/126 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 75/201 variables, 126/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 72/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 262 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5604 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 9149ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 9160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/243 places, 75/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9503 ms. Remains : 127/243 places, 75/185 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-01
Product exploration explored 100000 steps with 5621 reset in 392 ms.
Product exploration explored 100000 steps with 5549 reset in 286 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Detected a total of 24/127 stabilizing places and 19/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
RANDOM walk for 117 steps (5 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 75/75 transitions.
Applied a total of 0 rules in 8 ms. Remains 127 /127 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-31 21:51:51] [INFO ] Invariant cache hit.
[2024-05-31 21:51:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 21:51:51] [INFO ] Invariant cache hit.
[2024-05-31 21:51:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-31 21:51:51] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-31 21:51:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 2/126 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 75/201 variables, 126/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:51:52] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:51:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2024-05-31 21:51:52] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:51:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:51:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 190 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3126 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 2/126 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 75/201 variables, 126/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 72/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 262 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5369 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 8516ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 8518ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8767 ms. Remains : 127/127 places, 75/75 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Detected a total of 24/127 stabilizing places and 19/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 47 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5561 reset in 217 ms.
Product exploration explored 100000 steps with 5524 reset in 237 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 75/75 transitions.
Applied a total of 0 rules in 14 ms. Remains 127 /127 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-31 21:52:00] [INFO ] Invariant cache hit.
[2024-05-31 21:52:00] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-31 21:52:00] [INFO ] Invariant cache hit.
[2024-05-31 21:52:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-31 21:52:00] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-31 21:52:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 2/126 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 75/201 variables, 126/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:52:01] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:52:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:52:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 21:52:02] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:52:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 190 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3116 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 2/126 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 75/201 variables, 126/189 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 72/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/202 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 262 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5418 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 8556ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 8557ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8872 ms. Remains : 127/127 places, 75/75 transitions.
Treatment of property DES-PT-02b-LTLCardinality-01 finished in 29427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 4 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-31 21:52:09] [INFO ] Computed 61 invariants in 3 ms
[2024-05-31 21:52:09] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-31 21:52:09] [INFO ] Invariant cache hit.
[2024-05-31 21:52:09] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:52:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-31 21:52:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:12] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 11 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-31 21:52:13] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:14] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-31 21:52:14] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-31 21:52:14] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:16] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-31 21:52:16] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:52:16] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:52:16] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-31 21:52:16] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 4 ms to minimize.
[2024-05-31 21:52:17] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:52:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:52:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:19] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:52:19] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:20] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 3 ms to minimize.
[2024-05-31 21:52:20] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:52:21] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:52:22] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:52:22] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:52:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-31 21:52:22] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:52:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:52:25] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 16 ms to minimize.
[2024-05-31 21:52:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:52:25] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:26] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:52:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:52:26] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:52:26] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:52:26] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:52:28] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-31 21:52:28] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:30] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-31 21:52:30] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:52:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25393 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:52:37] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:37] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:52:37] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:52:37] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:52:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:38] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:40] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:52:40] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:52:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-31 21:52:40] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:52:54] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:52:54] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:52:54] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55424ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55427ms
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55819 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 351 ms.
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-02b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLCardinality-02 finished in 56489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 237 transition count 165
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 221 transition count 165
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 221 transition count 154
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 210 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 209 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 209 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 209 transition count 152
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 210 place count 133 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 214 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 129 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 128 transition count 76
Applied a total of 217 rules in 54 ms. Remains 128 /243 variables (removed 115) and now considering 76/185 (removed 109) transitions.
// Phase 1: matrix 76 rows 128 cols
[2024-05-31 21:53:06] [INFO ] Computed 58 invariants in 2 ms
[2024-05-31 21:53:06] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 21:53:06] [INFO ] Invariant cache hit.
[2024-05-31 21:53:06] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-31 21:53:06] [INFO ] Redundant transitions in 0 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-31 21:53:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 2/127 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/203 variables, 127/185 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-31 21:53:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 187 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 2/127 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 76/203 variables, 127/186 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 73/259 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-31 21:53:09] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/204 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-31 21:53:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/204 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 262 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7246 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints]
After SMT, in 9359ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 9361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/243 places, 76/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9665 ms. Remains : 128/243 places, 76/185 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-05
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-05 finished in 9713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(X(!p1)))||G(!p1)))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 9 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-31 21:53:15] [INFO ] Computed 61 invariants in 8 ms
[2024-05-31 21:53:15] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 21:53:15] [INFO ] Invariant cache hit.
[2024-05-31 21:53:16] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:53:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-31 21:53:18] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-31 21:53:19] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:20] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-31 21:53:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:53:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:22] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:53:22] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 3 ms to minimize.
[2024-05-31 21:53:22] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:53:22] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:53:23] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-31 21:53:23] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:53:23] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:53:23] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:25] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:53:26] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:26] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:53:26] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:53:27] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:28] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:53:28] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-31 21:53:29] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:53:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:53:29] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:53:31] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:53:31] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-31 21:53:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:53:31] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:32] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:53:32] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:53:32] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:53:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:53:32] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:53:34] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:53:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:36] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-31 21:53:36] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:53:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25531 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-31 21:53:43] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:43] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:53:43] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:53:44] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:53:44] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:46] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:53:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-31 21:53:46] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-31 21:53:46] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:51] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:53:59] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-31 21:53:59] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:53:59] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55581ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55584ms
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55924 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 232 ms :[p1, p1, p1, p1, p1]
Running random walk in product with property : DES-PT-02b-LTLCardinality-06
Product exploration explored 100000 steps with 3909 reset in 162 ms.
Stuttering criterion allowed to conclude after 70315 steps with 2761 reset in 116 ms.
FORMULA DES-PT-02b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-06 finished in 56453 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 U X(G(p0)))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 7 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
[2024-05-31 21:54:12] [INFO ] Invariant cache hit.
[2024-05-31 21:54:12] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-31 21:54:12] [INFO ] Invariant cache hit.
[2024-05-31 21:54:12] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:54:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-05-31 21:54:15] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:15] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-31 21:54:15] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:54:15] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-31 21:54:16] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:54:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:54:16] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-31 21:54:16] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2024-05-31 21:54:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-31 21:54:16] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-31 21:54:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:54:17] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-31 21:54:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:19] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-05-31 21:54:19] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-31 21:54:19] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:54:19] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-31 21:54:19] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-31 21:54:20] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:54:20] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-31 21:54:20] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:22] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:54:23] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:23] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:54:23] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:54:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:26] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:54:26] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:54:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:54:26] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:54:26] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:28] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:54:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:54:28] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-31 21:54:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:54:29] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:30] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:54:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:54:30] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:54:30] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:54:30] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:32] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:54:32] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:54:32] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:34] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-31 21:54:34] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:54:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 26748 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:40] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-31 21:54:41] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:41] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:54:41] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:54:41] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-31 21:54:41] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:42] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:54:43] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:54:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:54:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:49] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:54:57] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:54:57] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:54:57] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 56798ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 56800ms
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57193 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 3395 steps with 30 reset in 11 ms.
FORMULA DES-PT-02b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-07 finished in 57333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 242 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 184
Applied a total of 2 rules in 8 ms. Remains 242 /243 variables (removed 1) and now considering 184/185 (removed 1) transitions.
// Phase 1: matrix 184 rows 242 cols
[2024-05-31 21:55:09] [INFO ] Computed 61 invariants in 3 ms
[2024-05-31 21:55:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 21:55:09] [INFO ] Invariant cache hit.
[2024-05-31 21:55:09] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-31 21:55:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:12] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:55:12] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-31 21:55:12] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:55:12] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-31 21:55:12] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:55:12] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:13] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-31 21:55:14] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-31 21:55:14] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 184/426 variables, 242/320 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:16] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:55:16] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:55:16] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:55:16] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:55:17] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:18] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-31 21:55:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
[2024-05-31 21:55:19] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:55:19] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:55:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 21:55:19] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:22] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-31 21:55:22] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-31 21:55:23] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 4 ms to minimize.
[2024-05-31 21:55:23] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:55:23] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:55:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:55:23] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:55:23] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:55:23] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-31 21:55:24] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-31 21:55:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/426 variables, 11/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 357 constraints, problems are : Problem set: 0 solved, 183 unsolved in 18350 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 54/115 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:55:29] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-31 21:55:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:55:29] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-31 21:55:29] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:30] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:55:30] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 21:55:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:31] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:32] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 184/426 variables, 242/367 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 183/550 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:55:40] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 551 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 65/65 constraints]
After SMT, in 48387ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 48389ms
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 184/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48769 ms. Remains : 242/243 places, 184/185 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-09
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-09 finished in 48954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((G(F(p1))||G(p2))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 5 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-31 21:55:58] [INFO ] Computed 61 invariants in 5 ms
[2024-05-31 21:55:58] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 21:55:58] [INFO ] Invariant cache hit.
[2024-05-31 21:55:58] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:01] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:56:01] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:01] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:56:01] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:03] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-31 21:56:03] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:56:03] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:05] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:56:05] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-31 21:56:05] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:56:05] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-31 21:56:05] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-31 21:56:06] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-31 21:56:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:56:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:56:08] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-31 21:56:09] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:56:10] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:56:14] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:56:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-31 21:56:14] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:15] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:56:15] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:56:15] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:56:15] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-31 21:56:15] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:16] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-31 21:56:17] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 21:56:17] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25128 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:25] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-31 21:56:25] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:56:26] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:56:26] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-31 21:56:26] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:27] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:28] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:56:28] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:56:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-31 21:56:28] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:56:42] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:56:42] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:56:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55158ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55160ms
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55529 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLCardinality-10
Product exploration explored 100000 steps with 903 reset in 269 ms.
Product exploration explored 100000 steps with 903 reset in 315 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 171 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (357 resets) in 635 ms. (62 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (64 resets) in 239 ms. (166 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (63 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 157 ms. (253 steps per ms) remains 2/3 properties
[2024-05-31 21:56:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/164 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/215 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/225 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 169/394 variables, 225/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 19/413 variables, 11/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/419 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/421 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/423 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/423 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/164 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:56:56] [INFO ] Deduced a trap composed of 10 places in 417 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 215/423 variables, and 58 constraints, problems are : Problem set: 2 solved, 0 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 874ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p2)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 456 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 2 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-31 21:56:57] [INFO ] Invariant cache hit.
[2024-05-31 21:56:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 21:56:57] [INFO ] Invariant cache hit.
[2024-05-31 21:56:57] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:56:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:57:00] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:00] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-31 21:57:01] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:02] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-31 21:57:02] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:57:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-05-31 21:57:04] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-31 21:57:05] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:57:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:57:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:07] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:57:07] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:08] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:57:08] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:57:09] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:10] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:57:10] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:57:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:57:10] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:57:10] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:12] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:57:13] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:57:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:57:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-31 21:57:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:16] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:57:16] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-31 21:57:16] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25133 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:57:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:25] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:57:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:57:25] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-31 21:57:25] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:26] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:57:27] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:57:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:57:27] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55164ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55166ms
Finished structural reductions in LTL mode , in 1 iterations and 55504 ms. Remains : 241/241 places, 182/182 transitions.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (360 resets) in 229 ms. (173 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (64 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2024-05-31 21:57:53] [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) 48/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/163 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/215 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/225 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/394 variables, 225/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/413 variables, 11/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/419 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/421 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/423 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/423 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 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
At refinement iteration 1 (OVERLAPS) 48/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/163 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/215 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/225 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/394 variables, 225/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/413 variables, 11/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:57:54] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/419 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/421 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/423 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4030 steps, including 33 resets, run visited all 1 properties in 22 ms. (steps per millisecond=183 )
Parikh walk visited 1 properties in 30 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 899 reset in 186 ms.
Product exploration explored 100000 steps with 902 reset in 199 ms.
Applying partial POR strategy [false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 236 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 13 place count 236 transition count 182
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 236 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 232 transition count 178
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 232 transition count 178
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 105 place count 232 transition count 181
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 114 place count 223 transition count 172
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 123 place count 223 transition count 172
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 129 place count 223 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 221 transition count 194
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 221 transition count 194
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 133 rules in 48 ms. Remains 221 /241 variables (removed 20) and now considering 194/182 (removed -12) transitions.
[2024-05-31 21:57:56] [INFO ] Redundant transitions in 5 ms returned []
Running 193 sub problems to find dead transitions.
// Phase 1: matrix 194 rows 221 cols
[2024-05-31 21:57:56] [INFO ] Computed 59 invariants in 2 ms
[2024-05-31 21:57:56] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-31 21:57:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/79 constraints. Problems are: Problem set: 67 solved, 126 unsolved
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-31 21:57:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 5/84 constraints. Problems are: Problem set: 82 solved, 111 unsolved
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 7/91 constraints. Problems are: Problem set: 90 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/91 constraints. Problems are: Problem set: 90 solved, 103 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
At refinement iteration 8 (OVERLAPS) 194/415 variables, 221/312 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 12/324 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/324 constraints. Problems are: Problem set: 113 solved, 80 unsolved
[2024-05-31 21:58:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/415 variables, 1/325 constraints. Problems are: Problem set: 113 solved, 80 unsolved
[2024-05-31 21:58:03] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:58:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:58:03] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 3/328 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/328 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 14 (OVERLAPS) 0/415 variables, 0/328 constraints. Problems are: Problem set: 113 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 328 constraints, problems are : Problem set: 113 solved, 80 unsolved in 8511 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 221/221 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 113 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 68/201 variables, 33/45 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 2/47 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 36/83 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/83 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 12/213 variables, 12/95 constraints. Problems are: Problem set: 113 solved, 80 unsolved
[2024-05-31 21:58:05] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/96 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/96 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 190/403 variables, 213/309 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 12/321 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 80/401 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/401 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 12/415 variables, 8/409 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/409 constraints. Problems are: Problem set: 113 solved, 80 unsolved
At refinement iteration 15 (OVERLAPS) 0/415 variables, 0/409 constraints. Problems are: Problem set: 113 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 409 constraints, problems are : Problem set: 113 solved, 80 unsolved in 11090 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 221/221 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 80/193 constraints, Known Traps: 37/37 constraints]
After SMT, in 19661ms problems are : Problem set: 113 solved, 80 unsolved
Search for dead transitions found 113 dead transitions in 19663ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 221/241 places, 81/182 transitions.
Graph (complete) has 389 edges and 221 vertex of which 134 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.1 ms
Discarding 87 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 134 /221 variables (removed 87) and now considering 81/81 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 134/241 places, 81/182 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19741 ms. Remains : 134/241 places, 81/182 transitions.
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-31 21:58:15] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 21:58:16] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-31 21:58:16] [INFO ] Invariant cache hit.
[2024-05-31 21:58:16] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:58:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:18] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:58:18] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:20] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-31 21:58:20] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:58:20] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:22] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-31 21:58:22] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-31 21:58:22] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:58:22] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:58:22] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:58:23] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:58:23] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:58:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:25] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:58:25] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:26] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:58:26] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:58:27] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:28] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:58:28] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:58:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:58:29] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-31 21:58:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:58:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:58:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-31 21:58:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:58:31] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:32] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:58:32] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-31 21:58:32] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:58:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:58:32] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-31 21:58:34] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:58:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:36] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:58:36] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:58:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25209 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:58:43] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:58:43] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:58:43] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:58:43] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:45] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:58:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-31 21:58:46] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-31 21:58:46] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:51] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:58:59] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:58:59] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-31 21:58:59] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55242ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55245ms
Finished structural reductions in LTL mode , in 1 iterations and 55619 ms. Remains : 241/241 places, 182/182 transitions.
Treatment of property DES-PT-02b-LTLCardinality-10 finished in 192989 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(p1) U p2)||G(p3)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 241 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 241 transition count 182
Applied a total of 5 rules in 4 ms. Remains 241 /243 variables (removed 2) and now considering 182/185 (removed 3) transitions.
[2024-05-31 21:59:11] [INFO ] Invariant cache hit.
[2024-05-31 21:59:11] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 21:59:11] [INFO ] Invariant cache hit.
[2024-05-31 21:59:11] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 21:59:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:14] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:59:14] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:14] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-31 21:59:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:59:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:59:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 3 ms to minimize.
[2024-05-31 21:59:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:59:15] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:59:15] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:59:15] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-31 21:59:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-31 21:59:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:16] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-31 21:59:16] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:59:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:18] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:59:18] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:59:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:59:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:59:18] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:59:18] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:59:19] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:59:19] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:21] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:59:21] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:22] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:59:22] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:59:22] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:24] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:59:24] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:59:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:59:24] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:59:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:59:27] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:59:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:59:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:59:27] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:28] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:59:28] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:59:28] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:59:28] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:59:28] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-31 21:59:30] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-31 21:59:30] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:32] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:59:32] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:59:32] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25645 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:39] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-31 21:59:39] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:59:39] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:59:39] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-31 21:59:40] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:40] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:42] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:59:42] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-31 21:59:42] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-31 21:59:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 21:59:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-31 21:59:55] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:59:55] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55684ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55687ms
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 182/185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56024 ms. Remains : 241/243 places, 182/185 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-12
Product exploration explored 100000 steps with 2643 reset in 177 ms.
Product exploration explored 100000 steps with 2624 reset in 187 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/241 stabilizing places and 57/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3 p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 119 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
RANDOM walk for 240 steps (0 resets) in 7 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3 p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 15 factoid took 191 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
[2024-05-31 22:00:08] [INFO ] Invariant cache hit.
[2024-05-31 22:00:09] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-31 22:00:09] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 19 ms returned sat
[2024-05-31 22:00:09] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-05-31 22:00:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:00:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2024-05-31 22:00:09] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-31 22:00:09] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2024-05-31 22:00:09] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-31 22:00:09] [INFO ] Computed and/alt/rep : 180/305/180 causal constraints (skipped 1 transitions) in 13 ms.
[2024-05-31 22:00:11] [INFO ] Added : 162 causal constraints over 33 iterations in 1158 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 3 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-31 22:00:11] [INFO ] Invariant cache hit.
[2024-05-31 22:00:11] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 22:00:11] [INFO ] Invariant cache hit.
[2024-05-31 22:00:11] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 22:00:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:00:13] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:14] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:00:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:00:14] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:00:14] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:00:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:00:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:00:14] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:00:15] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:00:15] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:00:15] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:15] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:00:15] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:00:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:17] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:00:17] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:00:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:00:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:00:18] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:00:18] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:00:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:00:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:20] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-31 22:00:21] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:21] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:00:21] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:00:22] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:23] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:00:24] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:00:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:00:24] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:00:24] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:00:26] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:00:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:00:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:00:26] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:27] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:00:27] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:00:27] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:00:27] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:00:27] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:29] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:00:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:00:29] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:31] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:00:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:00:32] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25105 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:38] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:00:38] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:38] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:00:38] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:00:38] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:00:39] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:39] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:41] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:00:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:00:41] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:00:41] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:00:55] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:00:55] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:00:55] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55143ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55145ms
Finished structural reductions in LTL mode , in 1 iterations and 55473 ms. Remains : 241/241 places, 182/182 transitions.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
RANDOM walk for 587 steps (3 resets) in 9 ms. (58 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
[2024-05-31 22:01:07] [INFO ] Invariant cache hit.
[2024-05-31 22:01:07] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2024-05-31 22:01:07] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 20 ms returned sat
[2024-05-31 22:01:07] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-31 22:01:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:01:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-31 22:01:07] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-31 22:01:08] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2024-05-31 22:01:08] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:01:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-31 22:01:08] [INFO ] Computed and/alt/rep : 180/305/180 causal constraints (skipped 1 transitions) in 13 ms.
[2024-05-31 22:01:09] [INFO ] Added : 162 causal constraints over 33 iterations in 1157 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2632 reset in 173 ms.
Product exploration explored 100000 steps with 2611 reset in 190 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 236 transition count 179
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 15 place count 236 transition count 182
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 236 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 231 transition count 177
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 231 transition count 177
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 111 place count 231 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 121 place count 221 transition count 170
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 131 place count 221 transition count 170
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 221 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 219 transition count 182
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 219 transition count 182
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 31 ms. Remains 219 /241 variables (removed 22) and now considering 182/182 (removed 0) transitions.
[2024-05-31 22:01:10] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
// Phase 1: matrix 182 rows 219 cols
[2024-05-31 22:01:10] [INFO ] Computed 59 invariants in 3 ms
[2024-05-31 22:01:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 4/63 constraints. Problems are: Problem set: 33 solved, 148 unsolved
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 22:01:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/83 constraints. Problems are: Problem set: 85 solved, 96 unsolved
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-31 22:01:13] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 2/85 constraints. Problems are: Problem set: 89 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/85 constraints. Problems are: Problem set: 89 solved, 92 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 8 (OVERLAPS) 182/401 variables, 219/304 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 8/312 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/312 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/312 constraints. Problems are: Problem set: 107 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 312 constraints, problems are : Problem set: 107 solved, 74 unsolved in 5220 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 219/219 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 107 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 13/13 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 68/198 variables, 32/45 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/46 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 26/72 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/72 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 13/211 variables, 13/85 constraints. Problems are: Problem set: 107 solved, 74 unsolved
[2024-05-31 22:01:16] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/86 constraints. Problems are: Problem set: 107 solved, 74 unsolved
[2024-05-31 22:01:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:01:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 2/88 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/88 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 178/389 variables, 211/299 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 8/307 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 74/381 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/381 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 14 (OVERLAPS) 12/401 variables, 8/389 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/401 variables, 0/389 constraints. Problems are: Problem set: 107 solved, 74 unsolved
At refinement iteration 16 (OVERLAPS) 0/401 variables, 0/389 constraints. Problems are: Problem set: 107 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 389 constraints, problems are : Problem set: 107 solved, 74 unsolved in 9618 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 219/219 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 74/181 constraints, Known Traps: 29/29 constraints]
After SMT, in 14880ms problems are : Problem set: 107 solved, 74 unsolved
Search for dead transitions found 107 dead transitions in 14884ms
Found 107 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 107 transitions
Dead transitions reduction (with SMT) removed 107 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 219/241 places, 75/182 transitions.
Graph (complete) has 443 edges and 219 vertex of which 131 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 131 /219 variables (removed 88) and now considering 75/75 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 131/241 places, 75/182 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14931 ms. Remains : 131/241 places, 75/182 transitions.
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-31 22:01:25] [INFO ] Computed 61 invariants in 3 ms
[2024-05-31 22:01:25] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 22:01:25] [INFO ] Invariant cache hit.
[2024-05-31 22:01:25] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-31 22:01:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:27] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:01:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:28] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:01:28] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:01:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:01:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:01:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:01:28] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:01:29] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:01:29] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:01:29] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:01:29] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:29] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:01:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:01:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:31] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:01:31] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:01:32] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:01:32] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:01:32] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:01:32] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:01:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:01:32] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:34] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:01:35] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:35] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:01:36] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:01:36] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:38] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:01:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:01:38] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:01:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:01:38] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:01:40] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:01:40] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:01:40] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:01:40] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:41] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:01:41] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:01:41] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:01:42] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:01:42] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:01:43] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:01:43] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:45] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:01:45] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:01:46] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25192 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:52] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:01:52] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:52] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:01:53] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:01:53] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:01:53] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:54] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:01:55] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:01:55] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:01:55] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:01:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:02:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-31 22:02:09] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:02:09] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:02:09] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 55227ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55229ms
Finished structural reductions in LTL mode , in 1 iterations and 55661 ms. Remains : 241/241 places, 182/182 transitions.
Treatment of property DES-PT-02b-LTLCardinality-12 finished in 189254 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)||G(p1)))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 237 transition count 166
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 221 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 33 place count 221 transition count 153
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 57 place count 209 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 208 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 208 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 208 transition count 151
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 206 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 130 transition count 78
Applied a total of 213 rules in 23 ms. Remains 130 /243 variables (removed 113) and now considering 78/185 (removed 107) transitions.
// Phase 1: matrix 78 rows 130 cols
[2024-05-31 22:02:20] [INFO ] Computed 58 invariants in 2 ms
[2024-05-31 22:02:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-31 22:02:20] [INFO ] Invariant cache hit.
[2024-05-31 22:02:21] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-31 22:02:21] [INFO ] Redundant transitions in 0 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-31 22:02:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-31 22:02:21] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 2/129 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 78/207 variables, 129/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-31 22:02:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:02:22] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 1/208 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-31 22:02:23] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:02:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (OVERLAPS) 0/208 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 193 constraints, problems are : Problem set: 0 solved, 74 unsolved in 3636 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 2/129 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 78/207 variables, 129/192 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 74/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 1/208 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 267 constraints, problems are : Problem set: 0 solved, 74 unsolved in 7227 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 5/5 constraints]
After SMT, in 10876ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 10877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/243 places, 78/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11137 ms. Remains : 130/243 places, 78/185 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 61 steps with 3 reset in 0 ms.
FORMULA DES-PT-02b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLCardinality-14 finished in 11300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((G(F(p1))||G(p2))))))'
Found a Lengthening insensitive property : DES-PT-02b-LTLCardinality-10
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 435 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 237 transition count 169
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 225 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 224 transition count 168
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 27 place count 224 transition count 155
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 53 place count 211 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 210 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 210 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 210 transition count 153
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 202 place count 137 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 206 place count 135 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 133 transition count 80
Applied a total of 208 rules in 24 ms. Remains 133 /243 variables (removed 110) and now considering 80/185 (removed 105) transitions.
// Phase 1: matrix 80 rows 133 cols
[2024-05-31 22:02:32] [INFO ] Computed 59 invariants in 3 ms
[2024-05-31 22:02:32] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-31 22:02:32] [INFO ] Invariant cache hit.
[2024-05-31 22:02:32] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 22:02:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/131 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:34] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 80/212 variables, 132/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/213 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2946 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:02:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:36] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 80/212 variables, 132/196 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 76/272 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:37] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 16 (OVERLAPS) 1/213 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 18 (OVERLAPS) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 274 constraints, problems are : Problem set: 0 solved, 76 unsolved in 8231 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 11189ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 11191ms
Starting structural reductions in LI_LTL mode, iteration 1 : 133/243 places, 80/185 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11452 ms. Remains : 133/243 places, 80/185 transitions.
Running random walk in product with property : DES-PT-02b-LTLCardinality-10
Product exploration explored 100000 steps with 4239 reset in 238 ms.
Product exploration explored 100000 steps with 4231 reset in 253 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 375 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1663 resets) in 288 ms. (138 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (342 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (333 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
[2024-05-31 22:02:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/75 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/110 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/114 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/120 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 74/194 variables, 120/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/206 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/211 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/213 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/213 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/213 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/75 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 110/213 variables, and 51 constraints, problems are : Problem set: 2 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 28/34 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/133 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (G (OR p0 p2)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 634 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-31 22:02:46] [INFO ] Invariant cache hit.
[2024-05-31 22:02:47] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 22:02:47] [INFO ] Invariant cache hit.
[2024-05-31 22:02:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 22:02:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/131 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:48] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 80/212 variables, 132/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/213 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:49] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2886 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:50] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:02:50] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:50] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 80/212 variables, 132/196 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 76/272 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:02:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 16 (OVERLAPS) 1/213 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 18 (OVERLAPS) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 274 constraints, problems are : Problem set: 0 solved, 76 unsolved in 8376 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 11279ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 11281ms
Finished structural reductions in LTL mode , in 1 iterations and 11516 ms. Remains : 133/133 places, 80/80 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1661 resets) in 300 ms. (132 steps per ms) remains 1/6 properties
BEST_FIRST walk for 36696 steps (306 resets) in 46 ms. (780 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X (X p2))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 2 factoid took 293 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4240 reset in 228 ms.
Product exploration explored 100000 steps with 4230 reset in 240 ms.
Applying partial POR strategy [false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-31 22:03:00] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 22:03:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/131 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:02] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 80/212 variables, 132/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/213 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:04] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:03:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:04] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 80/212 variables, 132/196 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 76/272 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:05] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 16 (OVERLAPS) 1/213 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 18 (OVERLAPS) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 274 constraints, problems are : Problem set: 0 solved, 76 unsolved in 8377 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 11330ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 11331ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11339 ms. Remains : 133/133 places, 80/80 transitions.
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-31 22:03:12] [INFO ] Invariant cache hit.
[2024-05-31 22:03:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 22:03:12] [INFO ] Invariant cache hit.
[2024-05-31 22:03:12] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 22:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/131 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:13] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 80/212 variables, 132/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/213 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3095 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:03:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:16] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 80/212 variables, 132/196 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 76/272 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 16 (OVERLAPS) 1/213 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 18 (OVERLAPS) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 274 constraints, problems are : Problem set: 0 solved, 76 unsolved in 8374 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 11512ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 11524ms
Finished structural reductions in LTL mode , in 1 iterations and 11810 ms. Remains : 133/133 places, 80/80 transitions.
Treatment of property DES-PT-02b-LTLCardinality-10 finished in 51898 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(p1) U p2)||G(p3)))))'
[2024-05-31 22:03:24] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:03:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:03:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 243 places, 185 transitions and 559 arcs took 3 ms.
Total runtime 706142 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DES-PT-02b-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-02b-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-02b-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717193316869

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 DES-PT-02b-LTLCardinality-01
ltl formula formula --ltl=/tmp/4158/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 243 places, 185 transitions and 559 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.060 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4158/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4158/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4158/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4158/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 244 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 244, there are 191 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( 2/ 4): ~91 levels ~10000 states ~34140 transitions
pnml2lts-mc( 0/ 4): ~108 levels ~20000 states ~73888 transitions
pnml2lts-mc( 2/ 4): ~91 levels ~40000 states ~173556 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~80000 states ~352924 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~160000 states ~761400 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~320000 states ~1602752 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~640000 states ~3191696 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~1280000 states ~6970088 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~2560000 states ~15150152 transitions
pnml2lts-mc( 0/ 4): ~123 levels ~5120000 states ~32078740 transitions
pnml2lts-mc( 0/ 4): ~123 levels ~10240000 states ~65602880 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~20480000 states ~153057128 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552627
pnml2lts-mc( 0/ 4): unique states count: 33553008
pnml2lts-mc( 0/ 4): unique transitions count: 248313789
pnml2lts-mc( 0/ 4): - self-loop count: 242
pnml2lts-mc( 0/ 4): - claim dead count: 214759130
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553026
pnml2lts-mc( 0/ 4): - cum. max stack depth: 507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553026 states 248313837 transitions, fanout: 7.401
pnml2lts-mc( 0/ 4): Total exploration time 153.700 sec (153.680 sec minimum, 153.690 sec on average)
pnml2lts-mc( 0/ 4): States per second: 218302, Transitions per second: 1615575
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 288.4MB, 9.0 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/50.0%
pnml2lts-mc( 0/ 4): Stored 185 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 288.4MB (~256.0MB paged-in)
ltl formula name DES-PT-02b-LTLCardinality-10
ltl formula formula --ltl=/tmp/4158/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 243 places, 185 transitions and 559 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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4158/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4158/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4158/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4158/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 245 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 244, there are 351 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( 1/ 4): ~95 levels ~10000 states ~65228 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~20000 states ~111276 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~40000 states ~200128 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~80000 states ~444280 transitions
pnml2lts-mc( 1/ 4): ~96 levels ~160000 states ~1009612 transitions
pnml2lts-mc( 1/ 4): ~96 levels ~320000 states ~1872876 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~640000 states ~4101132 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~1280000 states ~9100872 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~2560000 states ~18905536 transitions
pnml2lts-mc( 1/ 4): ~97 levels ~5120000 states ~37908880 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~10240000 states ~84808640 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~20480000 states ~176021224 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552794
pnml2lts-mc( 0/ 4): unique states count: 33553151
pnml2lts-mc( 0/ 4): unique transitions count: 283729787
pnml2lts-mc( 0/ 4): - self-loop count: 1538
pnml2lts-mc( 0/ 4): - claim dead count: 250173376
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553162
pnml2lts-mc( 0/ 4): - cum. max stack depth: 488
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553162 states 283729816 transitions, fanout: 8.456
pnml2lts-mc( 0/ 4): Total exploration time 148.290 sec (148.280 sec minimum, 148.285 sec on average)
pnml2lts-mc( 0/ 4): States per second: 226267, Transitions per second: 1913344
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 282.0MB, 8.8 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/40.0%
pnml2lts-mc( 0/ 4): Stored 185 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 282.0MB (~256.0MB paged-in)
ltl formula name DES-PT-02b-LTLCardinality-12
ltl formula formula --ltl=/tmp/4158/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 243 places, 185 transitions and 559 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4158/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4158/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4158/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4158/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 245 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 244, there are 230 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): ~51 levels ~10000 states ~25772 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~20000 states ~55684 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~40000 states ~116456 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~80000 states ~255716 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~160000 states ~549380 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~320000 states ~1407044 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~640000 states ~3760588 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~1280000 states ~8589660 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1540595
pnml2lts-mc( 0/ 4): unique states count: 1540595
pnml2lts-mc( 0/ 4): unique transitions count: 10885878
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9349787
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1542120
pnml2lts-mc( 0/ 4): - cum. max stack depth: 205
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1542120 states 10897291 transitions, fanout: 7.066
pnml2lts-mc( 0/ 4): Total exploration time 8.830 sec (8.810 sec minimum, 8.823 sec on average)
pnml2lts-mc( 0/ 4): States per second: 174646, Transitions per second: 1234121
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.0MB, 8.2 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 185 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 12.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-02b"
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 DES-PT-02b, 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 r480-tall-171624189700643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-02b.tgz
mv DES-PT-02b 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 ;