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.r092-tall-171624189700627.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DES-PT-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189700627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 08:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 08:06 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 68K 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-01b-LTLCardinality-00
FORMULA_NAME DES-PT-01b-LTLCardinality-01
FORMULA_NAME DES-PT-01b-LTLCardinality-02
FORMULA_NAME DES-PT-01b-LTLCardinality-03
FORMULA_NAME DES-PT-01b-LTLCardinality-04
FORMULA_NAME DES-PT-01b-LTLCardinality-05
FORMULA_NAME DES-PT-01b-LTLCardinality-06
FORMULA_NAME DES-PT-01b-LTLCardinality-07
FORMULA_NAME DES-PT-01b-LTLCardinality-08
FORMULA_NAME DES-PT-01b-LTLCardinality-09
FORMULA_NAME DES-PT-01b-LTLCardinality-10
FORMULA_NAME DES-PT-01b-LTLCardinality-11
FORMULA_NAME DES-PT-01b-LTLCardinality-12
FORMULA_NAME DES-PT-01b-LTLCardinality-13
FORMULA_NAME DES-PT-01b-LTLCardinality-14
FORMULA_NAME DES-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716335826203

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:57:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:57:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:57:07] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-21 23:57:07] [INFO ] Transformed 284 places.
[2024-05-21 23:57:07] [INFO ] Transformed 235 transitions.
[2024-05-21 23:57:07] [INFO ] Found NUPN structural information;
[2024-05-21 23:57:07] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-01b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 259 transition count 213
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 259 transition count 213
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 245 transition count 199
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 245 transition count 199
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 86 place count 245 transition count 188
Applied a total of 86 rules in 76 ms. Remains 245 /284 variables (removed 39) and now considering 188/235 (removed 47) transitions.
// Phase 1: matrix 188 rows 245 cols
[2024-05-21 23:57:07] [INFO ] Computed 62 invariants in 21 ms
[2024-05-21 23:57:08] [INFO ] Implicit Places using invariants in 274 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 302 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/284 places, 188/235 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 243/284 places, 188/235 transitions.
Support contains 17 out of 243 places after structural reductions.
[2024-05-21 23:57:08] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:57:08] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:57:08] [INFO ] Input system was already deterministic with 188 transitions.
RANDOM walk for 4778 steps (44 resets) in 147 ms. (32 steps per ms) remains 0/10 properties
Computed a total of 53 stabilizing places and 49 stable transitions
Graph (complete) has 430 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(p1))&&G(!p0))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 238 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 238 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 237 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 237 transition count 179
Applied a total of 15 rules in 12 ms. Remains 237 /243 variables (removed 6) and now considering 179/188 (removed 9) transitions.
// Phase 1: matrix 179 rows 237 cols
[2024-05-21 23:57:08] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 23:57:08] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 23:57:08] [INFO ] Invariant cache hit.
[2024-05-21 23:57:08] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-21 23:57:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 24 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:57:11] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 179/416 variables, 237/336 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:57:17] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:18] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:57:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/416 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:57:22] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 348 constraints, problems are : Problem set: 0 solved, 178 unsolved in 18527 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:57:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/416 variables, 237/351 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 178/529 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:57:31] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:57:32] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:57:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 23:57:54] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 536 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 61/61 constraints]
After SMT, in 48617ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 48635ms
Starting structural reductions in LTL mode, iteration 1 : 237/243 places, 179/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48993 ms. Remains : 237/243 places, 179/188 transitions.
Stuttering acceptance computed with spot in 236 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 3 ms.
FORMULA DES-PT-01b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLCardinality-01 finished in 49284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Graph (complete) has 430 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 237 transition count 164
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 217 transition count 163
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 42 place count 217 transition count 151
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 205 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 202 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 202 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 202 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 201 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 201 transition count 145
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 3 with 146 rules applied. Total rules applied 222 place count 128 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 125 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 123 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 232 place count 121 transition count 78
Applied a total of 232 rules in 55 ms. Remains 121 /243 variables (removed 122) and now considering 78/188 (removed 110) transitions.
// Phase 1: matrix 78 rows 121 cols
[2024-05-21 23:57:57] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:57:58] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 23:57:58] [INFO ] Invariant cache hit.
[2024-05-21 23:57:58] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [7, 29, 33, 37, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 93, 116]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 258 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/243 places, 78/188 transitions.
Graph (complete) has 232 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 96 transition count 66
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 86 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 85 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 85 transition count 58
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 61 place count 59 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 57 transition count 45
Applied a total of 64 rules in 15 ms. Remains 57 /99 variables (removed 42) and now considering 45/78 (removed 33) transitions.
// Phase 1: matrix 45 rows 57 cols
[2024-05-21 23:57:58] [INFO ] Computed 18 invariants in 0 ms
[2024-05-21 23:57:58] [INFO ] Implicit Places using invariants in 54 ms returned [41, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/243 places, 45/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 52 transition count 41
Applied a total of 6 rules in 5 ms. Remains 52 /55 variables (removed 3) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 52 cols
[2024-05-21 23:57:58] [INFO ] Computed 16 invariants in 0 ms
[2024-05-21 23:57:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 23:57:58] [INFO ] Invariant cache hit.
[2024-05-21 23:57:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/243 places, 41/188 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 473 ms. Remains : 52/243 places, 41/188 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-02
Product exploration explored 100000 steps with 14364 reset in 313 ms.
Product exploration explored 100000 steps with 14316 reset in 166 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 30 steps (0 resets) in 8 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-21 23:57:59] [INFO ] Invariant cache hit.
[2024-05-21 23:57:59] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-21 23:57:59] [INFO ] [Real]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 23:57:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 23:57:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:57:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-21 23:57:59] [INFO ] [Nat]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 23:57:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 23:57:59] [INFO ] Computed and/alt/rep : 33/96/33 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 23:57:59] [INFO ] Added : 27 causal constraints over 6 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-21 23:57:59] [INFO ] Invariant cache hit.
[2024-05-21 23:57:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 23:57:59] [INFO ] Invariant cache hit.
[2024-05-21 23:57:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-21 23:57:59] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-21 23:57:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 4/51 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 1/52 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 41/93 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-21 23:57:59] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 69 constraints, problems are : Problem set: 0 solved, 33 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/51 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 41/93 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 33/102 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/93 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 102 constraints, problems are : Problem set: 0 solved, 33 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1205 ms. Remains : 52/52 places, 41/41 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 34 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-21 23:58:00] [INFO ] Invariant cache hit.
[2024-05-21 23:58:00] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-05-21 23:58:00] [INFO ] [Real]Absence check using 12 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-21 23:58:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-21 23:58:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:58:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-21 23:58:00] [INFO ] [Nat]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 23:58:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-21 23:58:00] [INFO ] Computed and/alt/rep : 33/96/33 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 23:58:00] [INFO ] Added : 27 causal constraints over 6 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14365 reset in 111 ms.
Product exploration explored 100000 steps with 14342 reset in 181 ms.
Built C files in :
/tmp/ltsmin2369197455727174708
[2024-05-21 23:58:01] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-21 23:58:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:58:01] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-21 23:58:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:58:01] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-21 23:58:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:58:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2369197455727174708
Running compilation step : cd /tmp/ltsmin2369197455727174708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin2369197455727174708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2369197455727174708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14142048797721599309.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA DES-PT-01b-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLCardinality-02 finished in 3994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 237 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 237 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 237 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 236 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 236 transition count 178
Applied a total of 17 rules in 19 ms. Remains 236 /243 variables (removed 7) and now considering 178/188 (removed 10) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-21 23:58:01] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 23:58:01] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 23:58:01] [INFO ] Invariant cache hit.
[2024-05-21 23:58:02] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:58:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17046 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27278 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44350ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44353ms
Starting structural reductions in LTL mode, iteration 1 : 236/243 places, 178/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44662 ms. Remains : 236/243 places, 178/188 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-08
Product exploration explored 100000 steps with 20462 reset in 100 ms.
Product exploration explored 100000 steps with 20394 reset in 90 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-21 23:58:47] [INFO ] Invariant cache hit.
[2024-05-21 23:58:47] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:58:47] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-21 23:58:47] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-21 23:58:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:58:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 23:58:47] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-21 23:58:48] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2024-05-21 23:58:48] [INFO ] Computed and/alt/rep : 176/289/176 causal constraints (skipped 1 transitions) in 11 ms.
[2024-05-21 23:58:48] [INFO ] Added : 119 causal constraints over 24 iterations in 781 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 230 transition count 156
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 212 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 212 transition count 144
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 61 place count 200 transition count 144
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 209 place count 126 transition count 70
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 2 with 4 rules applied. Total rules applied 213 place count 124 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 123 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 216 place count 121 transition count 71
Applied a total of 216 rules in 24 ms. Remains 121 /236 variables (removed 115) and now considering 71/178 (removed 107) transitions.
// Phase 1: matrix 71 rows 121 cols
[2024-05-21 23:58:48] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:58:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 23:58:49] [INFO ] Invariant cache hit.
[2024-05-21 23:58:49] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [8, 30, 34, 38, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 95, 116]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 233 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/236 places, 71/178 transitions.
Graph (complete) has 230 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 96 transition count 69
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3 place count 96 transition count 61
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 19 place count 88 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 58 place count 62 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 60 transition count 47
Applied a total of 61 rules in 9 ms. Remains 60 /99 variables (removed 39) and now considering 47/71 (removed 24) transitions.
// Phase 1: matrix 47 rows 60 cols
[2024-05-21 23:58:49] [INFO ] Computed 19 invariants in 13 ms
[2024-05-21 23:58:49] [INFO ] Implicit Places using invariants in 77 ms returned [38, 46, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/236 places, 47/178 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 55 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 55 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 54 transition count 43
Applied a total of 6 rules in 7 ms. Remains 54 /57 variables (removed 3) and now considering 43/47 (removed 4) transitions.
// Phase 1: matrix 43 rows 54 cols
[2024-05-21 23:58:49] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 23:58:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 23:58:49] [INFO ] Invariant cache hit.
[2024-05-21 23:58:49] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/236 places, 43/178 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 456 ms. Remains : 54/236 places, 43/178 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLCardinality-08 finished in 47559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 238 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 238 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 238 transition count 180
Applied a total of 13 rules in 9 ms. Remains 238 /243 variables (removed 5) and now considering 180/188 (removed 8) transitions.
// Phase 1: matrix 180 rows 238 cols
[2024-05-21 23:58:49] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 23:58:49] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:58:49] [INFO ] Invariant cache hit.
[2024-05-21 23:58:49] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-21 23:58:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:58:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:58:57] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:57] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 180/418 variables, 238/341 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:58:59] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:59:00] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:59:00] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:59:00] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:59:00] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:59:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:59:00] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:59:00] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:04] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 351 constraints, problems are : Problem set: 0 solved, 179 unsolved in 19270 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 53/113 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/418 variables, 238/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 179/530 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:11] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:59:11] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:59:11] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:59:12] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:59:12] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:59:12] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:59:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 7/537 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 538 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 61/61 constraints]
After SMT, in 49309ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 49311ms
Starting structural reductions in LTL mode, iteration 1 : 238/243 places, 180/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49602 ms. Remains : 238/243 places, 180/188 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-09
Product exploration explored 100000 steps with 20000 reset in 78 ms.
Product exploration explored 100000 steps with 20000 reset in 77 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 11855 steps (125 resets) in 32 ms. (359 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 23:59:40] [INFO ] Invariant cache hit.
[2024-05-21 23:59:40] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 23:59:40] [INFO ] Invariant cache hit.
[2024-05-21 23:59:40] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-21 23:59:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:59:42] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:59:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:59:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:59:48] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 180/418 variables, 238/341 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:59:51] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:53] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:59:55] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 351 constraints, problems are : Problem set: 0 solved, 179 unsolved in 19324 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 53/113 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/418 variables, 238/351 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 179/530 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:04] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 7/537 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 538 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 61/61 constraints]
After SMT, in 49368ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 49374ms
Finished structural reductions in LTL mode , in 1 iterations and 49654 ms. Remains : 238/238 places, 180/180 transitions.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 18003 steps (193 resets) in 51 ms. (346 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 73 ms.
Product exploration explored 100000 steps with 20000 reset in 78 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 180/180 transitions.
Graph (complete) has 420 edges and 238 vertex of which 233 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 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 233 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 18 place count 233 transition count 179
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 28 place count 233 transition count 179
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 227 transition count 173
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 227 transition count 173
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 115 place count 227 transition count 176
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 218 transition count 167
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 218 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 139 place count 218 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 216 transition count 189
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 216 transition count 189
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 143 rules in 37 ms. Remains 216 /238 variables (removed 22) and now considering 189/180 (removed -9) transitions.
[2024-05-22 00:00:31] [INFO ] Redundant transitions in 5 ms returned []
Running 188 sub problems to find dead transitions.
// Phase 1: matrix 189 rows 216 cols
[2024-05-22 00:00:31] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:00:31] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
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 TDEAD13 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 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 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 TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/78 constraints. Problems are: Problem set: 68 solved, 120 unsolved
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 10/88 constraints. Problems are: Problem set: 98 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/88 constraints. Problems are: Problem set: 98 solved, 90 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 7 (OVERLAPS) 189/405 variables, 216/304 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 17/321 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/321 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/321 constraints. Problems are: Problem set: 116 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 321 constraints, problems are : Problem set: 116 solved, 72 unsolved in 5518 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 216/216 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 116 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 12/12 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 68/192 variables, 33/45 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 30/75 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/75 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 16/208 variables, 13/88 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/88 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 185/393 variables, 208/296 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 17/313 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 72/385 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/385 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 12/405 variables, 8/393 constraints. Problems are: Problem set: 116 solved, 72 unsolved
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 1/394 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/394 constraints. Problems are: Problem set: 116 solved, 72 unsolved
At refinement iteration 14 (OVERLAPS) 0/405 variables, 0/394 constraints. Problems are: Problem set: 116 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 394 constraints, problems are : Problem set: 116 solved, 72 unsolved in 9265 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 216/216 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 72/188 constraints, Known Traps: 31/31 constraints]
After SMT, in 14829ms problems are : Problem set: 116 solved, 72 unsolved
Search for dead transitions found 116 dead transitions in 14832ms
Found 116 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 116 transitions
Dead transitions reduction (with SMT) removed 116 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 216/238 places, 73/180 transitions.
Graph (complete) has 431 edges and 216 vertex of which 125 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 125 /216 variables (removed 91) and now considering 73/73 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/238 places, 73/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14892 ms. Remains : 125/238 places, 73/180 transitions.
Built C files in :
/tmp/ltsmin8811421428751494008
[2024-05-22 00:00:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8811421428751494008
Running compilation step : cd /tmp/ltsmin8811421428751494008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 313 ms.
Running link step : cd /tmp/ltsmin8811421428751494008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8811421428751494008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10014947250328790440.hoa' '--buchi-type=spotba'
LTSmin run took 355 ms.
FORMULA DES-PT-01b-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLCardinality-09 finished in 117724 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, 188/188 transitions.
Graph (complete) has 430 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 237 transition count 163
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 216 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 44 place count 216 transition count 149
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 70 place count 203 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 201 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 201 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 201 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 200 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 200 transition count 145
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 219 place count 129 transition count 74
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 223 place count 127 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 125 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 227 place count 123 transition count 74
Applied a total of 227 rules in 28 ms. Remains 123 /243 variables (removed 120) and now considering 74/188 (removed 114) transitions.
// Phase 1: matrix 74 rows 123 cols
[2024-05-22 00:00:47] [INFO ] Computed 56 invariants in 3 ms
[2024-05-22 00:00:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 00:00:47] [INFO ] Invariant cache hit.
[2024-05-22 00:00:47] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [9, 31, 35, 39, 44, 46, 48, 50, 52, 54, 56, 58, 97, 118]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 188 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/243 places, 74/188 transitions.
Graph (complete) has 264 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 106 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 104 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 103 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 103 transition count 66
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 31 place count 91 transition count 54
Applied a total of 31 rules in 7 ms. Remains 91 /109 variables (removed 18) and now considering 54/74 (removed 20) transitions.
// Phase 1: matrix 54 rows 91 cols
[2024-05-22 00:00:47] [INFO ] Computed 41 invariants in 1 ms
[2024-05-22 00:00:47] [INFO ] Implicit Places using invariants in 55 ms returned [71, 77, 80]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/243 places, 54/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 85 transition count 50
Applied a total of 6 rules in 5 ms. Remains 85 /88 variables (removed 3) and now considering 50/54 (removed 4) transitions.
// Phase 1: matrix 50 rows 85 cols
[2024-05-22 00:00:47] [INFO ] Computed 38 invariants in 0 ms
[2024-05-22 00:00:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 00:00:47] [INFO ] Invariant cache hit.
[2024-05-22 00:00:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 00:00:47] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 85/243 places, 50/188 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 431 ms. Remains : 85/243 places, 50/188 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-13
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA DES-PT-01b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLCardinality-13 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F((p1&&X(p2)))&&X(F(p3)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 240 transition count 185
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 240 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 240 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 239 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 239 transition count 183
Applied a total of 9 rules in 6 ms. Remains 239 /243 variables (removed 4) and now considering 183/188 (removed 5) transitions.
// Phase 1: matrix 183 rows 239 cols
[2024-05-22 00:00:47] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:00:47] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 00:00:47] [INFO ] Invariant cache hit.
[2024-05-22 00:00:47] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-22 00:00:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 183/422 variables, 239/336 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:00:57] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:00:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/422 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 344 constraints, problems are : Problem set: 0 solved, 182 unsolved in 21463 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/422 variables, 239/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 182/526 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:01:19] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:01:33] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 532 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 51/51 constraints]
After SMT, in 51491ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 51493ms
Starting structural reductions in LTL mode, iteration 1 : 239/243 places, 183/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51762 ms. Remains : 239/243 places, 183/188 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01b-LTLCardinality-14
Product exploration explored 100000 steps with 4542 reset in 164 ms.
Product exploration explored 100000 steps with 4610 reset in 215 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 422 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p2)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p1), (X (NOT p3)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT p3))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 119 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (386 resets) in 611 ms. (65 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40003 steps (60 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (64 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (59 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2024-05-22 00:01:40] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 126/169 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 46/215 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/223 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 170/393 variables, 223/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 19/412 variables, 11/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/418 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/420 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/422 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 299 constraints, problems are : Problem set: 0 solved, 3 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 126/169 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Int declared 215/422 variables, and 57 constraints, problems are : Problem set: 3 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p2)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p1), (X (NOT p3)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT p3))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (G (OR p1 p2)), (G (OR (NOT p0) p1 p2)), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F p3), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 36 factoid took 652 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 533 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 439 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Support contains 7 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 183/183 transitions.
Graph (complete) has 422 edges and 239 vertex of which 234 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 233 transition count 163
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 217 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 216 transition count 162
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 216 transition count 151
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 57 place count 205 transition count 151
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 197 place count 135 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 134 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 132 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 130 transition count 80
Applied a total of 203 rules in 21 ms. Remains 130 /239 variables (removed 109) and now considering 80/183 (removed 103) transitions.
// Phase 1: matrix 80 rows 130 cols
[2024-05-22 00:01:42] [INFO ] Computed 56 invariants in 1 ms
[2024-05-22 00:01:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 00:01:42] [INFO ] Invariant cache hit.
[2024-05-22 00:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:01:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [48, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 104, 125]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 196 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/239 places, 80/183 transitions.
Graph (complete) has 248 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 108 transition count 68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 98 transition count 68
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 55 place count 74 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 72 transition count 57
Applied a total of 58 rules in 5 ms. Remains 72 /111 variables (removed 39) and now considering 57/80 (removed 23) transitions.
// Phase 1: matrix 57 rows 72 cols
[2024-05-22 00:01:43] [INFO ] Computed 21 invariants in 1 ms
[2024-05-22 00:01:43] [INFO ] Implicit Places using invariants in 39 ms returned [58, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/239 places, 57/183 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 68 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 67 transition count 53
Applied a total of 6 rules in 3 ms. Remains 67 /70 variables (removed 3) and now considering 53/57 (removed 4) transitions.
// Phase 1: matrix 53 rows 67 cols
[2024-05-22 00:01:43] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 00:01:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 00:01:43] [INFO ] Invariant cache hit.
[2024-05-22 00:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:01:43] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 67/239 places, 53/183 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 363 ms. Remains : 67/239 places, 53/183 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2)), (X (NOT (AND p2 p0 p3))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p2 (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p3)), (X p3), (X (NOT p2)), (X p2), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p2 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p2) p0 p3)), (X (NOT (AND (NOT p2) p0 p3))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0 p3))), (X (X (NOT (AND p2 p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) p0 p3))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 1296 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter insensitive) to 11 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 477 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 535 steps (24 resets) in 9 ms. (53 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2)), (X (NOT (AND p2 p0 p3))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p2 (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT p3)), (X p3), (X (NOT p2)), (X p2), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p2 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p2) p0 p3)), (X (NOT (AND (NOT p2) p0 p3))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0 p3))), (X (X (NOT (AND p2 p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) p0 p3))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p2) p0 (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR p2 p0))), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0 p3))), (F (NOT (OR p2 p0 (NOT p3)))), (F (NOT (OR p2 (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p3)))), (F p2), (F p3), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (NOT p2) (NOT p0) p3)))]
Knowledge based reduction with 11 factoid took 2078 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter insensitive) to 11 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 592 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 447 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 483 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 29428 reset in 144 ms.
Product exploration explored 100000 steps with 29296 reset in 160 ms.
Built C files in :
/tmp/ltsmin16519751759985858071
[2024-05-22 00:01:48] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-22 00:01:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:48] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-22 00:01:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:48] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-22 00:01:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16519751759985858071
Running compilation step : cd /tmp/ltsmin16519751759985858071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin16519751759985858071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16519751759985858071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12179915498924924606.hoa' '--buchi-type=spotba'
LTSmin run took 337 ms.
FORMULA DES-PT-01b-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLCardinality-14 finished in 61917 ms.
All properties solved by simple procedures.
Total runtime 282192 ms.

BK_STOP 1716336109571

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-01b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DES-PT-01b, 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 r092-tall-171624189700627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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