About the Execution of GreatSPN+red for ParamProductionCell-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 486.720 | 121162.00 | 172380.00 | 607.30 | TTTTFFFTFFTFTFFT | normal |
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.r267-smll-171654405600051.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 greatspnxred
Input is ParamProductionCell-PT-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405600051
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716651988396
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:46:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:46:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:46:30] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-25 15:46:30] [INFO ] Transformed 231 places.
[2024-05-25 15:46:30] [INFO ] Transformed 202 transitions.
[2024-05-25 15:46:30] [INFO ] Found NUPN structural information;
[2024-05-25 15:46:30] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ParamProductionCell-PT-5-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 228 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 228 transition count 199
Applied a total of 6 rules in 66 ms. Remains 228 /231 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 228 cols
[2024-05-25 15:46:30] [INFO ] Computed 59 invariants in 27 ms
[2024-05-25 15:46:31] [INFO ] Implicit Places using invariants in 614 ms returned [15, 16, 19, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 73, 78, 79, 98, 99, 101, 113, 114, 116, 119, 161, 162, 164, 166, 167, 193, 194, 197, 198, 203, 204]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 665 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/231 places, 199/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 193 /193 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 193/231 places, 199/202 transitions.
Support contains 27 out of 193 places after structural reductions.
[2024-05-25 15:46:31] [INFO ] Flatten gal took : 78 ms
[2024-05-25 15:46:31] [INFO ] Flatten gal took : 46 ms
[2024-05-25 15:46:32] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 23 out of 193 places (down from 27) after GAL structural reductions.
RANDOM walk for 33435 steps (7 resets) in 1330 ms. (25 steps per ms) remains 0/16 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 188 transition count 194
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 188 transition count 194
Applied a total of 10 rules in 13 ms. Remains 188 /193 variables (removed 5) and now considering 194/199 (removed 5) transitions.
// Phase 1: matrix 194 rows 188 cols
[2024-05-25 15:46:32] [INFO ] Computed 24 invariants in 3 ms
[2024-05-25 15:46:33] [INFO ] Implicit Places using invariants in 205 ms returned [16, 94, 168, 179]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 207 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/193 places, 194/199 transitions.
Applied a total of 0 rules in 11 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 232 ms. Remains : 184/193 places, 194/199 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-00
Product exploration explored 100000 steps with 3347 reset in 371 ms.
Product exploration explored 100000 steps with 3346 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 627 steps (0 resets) in 18 ms. (33 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
// Phase 1: matrix 194 rows 184 cols
[2024-05-25 15:46:35] [INFO ] Computed 20 invariants in 6 ms
[2024-05-25 15:46:35] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-25 15:46:35] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 15:46:35] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-05-25 15:46:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:46:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2024-05-25 15:46:36] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-25 15:46:36] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2024-05-25 15:46:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:46:36] [INFO ] [Nat]Added 68 Read/Feed constraints in 85 ms returned sat
[2024-05-25 15:46:37] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 14 ms to minimize.
[2024-05-25 15:46:37] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 4 ms to minimize.
[2024-05-25 15:46:37] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 4 ms to minimize.
[2024-05-25 15:46:37] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 3 ms to minimize.
[2024-05-25 15:46:38] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 4 ms to minimize.
[2024-05-25 15:46:38] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-05-25 15:46:38] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-25 15:46:38] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 11 ms to minimize.
[2024-05-25 15:46:38] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-25 15:46:38] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 3 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 3 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 3 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:46:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2808 ms
[2024-05-25 15:46:39] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-25 15:46:40] [INFO ] Added : 178 causal constraints over 36 iterations in 1071 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 184 transition count 153
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 143 transition count 153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 82 place count 143 transition count 141
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 106 place count 131 transition count 141
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 190 place count 89 transition count 99
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 194 place count 87 transition count 97
Applied a total of 194 rules in 69 ms. Remains 87 /184 variables (removed 97) and now considering 97/194 (removed 97) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-05-25 15:46:40] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:46:41] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-25 15:46:41] [INFO ] Invariant cache hit.
[2024-05-25 15:46:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:46:41] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-25 15:46:41] [INFO ] Redundant transitions in 4 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-25 15:46:41] [INFO ] Invariant cache hit.
[2024-05-25 15:46:41] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:46:42] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:46:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 2/87 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:46:44] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:46:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
[2024-05-25 15:46:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 97/184 variables, 87/142 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 66/208 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 208 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6002 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:47] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:46:47] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:46:48] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:46:48] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 18 ms to minimize.
[2024-05-25 15:46:48] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:48] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/184 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 94/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 309 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5294 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 42/42 constraints]
After SMT, in 11396ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 11410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/184 places, 97/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11841 ms. Remains : 87/184 places, 97/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 169 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 264 steps (0 resets) in 9 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 375 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-25 15:46:54] [INFO ] Invariant cache hit.
[2024-05-25 15:46:54] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 15:46:54] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:46:54] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-25 15:46:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:46:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 15:46:54] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:46:54] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-25 15:46:54] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:46:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:46:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 434 ms
[2024-05-25 15:46:54] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-25 15:46:55] [INFO ] Added : 83 causal constraints over 17 iterations in 224 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 6263 reset in 246 ms.
Product exploration explored 100000 steps with 6232 reset in 202 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 87 /87 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-25 15:46:55] [INFO ] Invariant cache hit.
[2024-05-25 15:46:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-25 15:46:55] [INFO ] Invariant cache hit.
[2024-05-25 15:46:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:46:56] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-25 15:46:56] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-25 15:46:56] [INFO ] Invariant cache hit.
[2024-05-25 15:46:56] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:46:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 4 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:46:57] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:46:58] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:46:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:46:58] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 2/87 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:46:58] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:46:58] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:46:58] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:46:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 97/184 variables, 87/142 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 66/208 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 208 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5256 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-25 15:47:02] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:47:02] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:47:02] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:02] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/184 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 94/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 309 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4561 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 42/42 constraints]
After SMT, in 9844ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 9847ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10188 ms. Remains : 87/87 places, 97/97 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-00 finished in 33278 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 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 193 transition count 167
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 161 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 160 transition count 166
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 66 place count 160 transition count 148
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 102 place count 142 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 137 transition count 143
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 137 transition count 143
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 190 place count 98 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 97 transition count 103
Applied a total of 192 rules in 44 ms. Remains 97 /193 variables (removed 96) and now considering 103/199 (removed 96) transitions.
// Phase 1: matrix 103 rows 97 cols
[2024-05-25 15:47:06] [INFO ] Computed 24 invariants in 2 ms
[2024-05-25 15:47:06] [INFO ] Implicit Places using invariants in 106 ms returned [8, 51, 85, 91]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/193 places, 103/199 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 87 transition count 97
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 14 place count 86 transition count 96
Applied a total of 14 rules in 9 ms. Remains 86 /93 variables (removed 7) and now considering 96/103 (removed 7) transitions.
// Phase 1: matrix 96 rows 86 cols
[2024-05-25 15:47:06] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:47:06] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-25 15:47:06] [INFO ] Invariant cache hit.
[2024-05-25 15:47:06] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:06] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/193 places, 96/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 577 ms. Remains : 86/193 places, 96/199 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 275 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-04 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 193 transition count 170
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 164 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 162 transition count 168
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 62 place count 162 transition count 149
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 100 place count 143 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 138 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 138 transition count 144
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 190 place count 98 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 97 transition count 103
Applied a total of 192 rules in 24 ms. Remains 97 /193 variables (removed 96) and now considering 103/199 (removed 96) transitions.
// Phase 1: matrix 103 rows 97 cols
[2024-05-25 15:47:06] [INFO ] Computed 24 invariants in 1 ms
[2024-05-25 15:47:07] [INFO ] Implicit Places using invariants in 120 ms returned [9, 51, 91]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 121 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/193 places, 103/199 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 99
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 10 place count 89 transition count 98
Applied a total of 10 rules in 8 ms. Remains 89 /94 variables (removed 5) and now considering 98/103 (removed 5) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 15:47:07] [INFO ] Computed 21 invariants in 4 ms
[2024-05-25 15:47:07] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-25 15:47:07] [INFO ] Invariant cache hit.
[2024-05-25 15:47:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:07] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/193 places, 98/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 537 ms. Remains : 89/193 places, 98/199 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-06
Product exploration explored 100000 steps with 2720 reset in 125 ms.
Stack based approach found an accepted trace after 1063 steps with 21 reset with depth 108 and stack size 108 in 12 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-06 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 189 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 189 transition count 195
Applied a total of 8 rules in 5 ms. Remains 189 /193 variables (removed 4) and now considering 195/199 (removed 4) transitions.
// Phase 1: matrix 195 rows 189 cols
[2024-05-25 15:47:07] [INFO ] Computed 24 invariants in 1 ms
[2024-05-25 15:47:07] [INFO ] Implicit Places using invariants in 128 ms returned [16, 94, 169]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 142 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/193 places, 195/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 186/193 places, 195/199 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-08 finished in 303 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((p1&&G(F(p2))))&&p0)))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 189 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 189 transition count 195
Applied a total of 8 rules in 5 ms. Remains 189 /193 variables (removed 4) and now considering 195/199 (removed 4) transitions.
// Phase 1: matrix 195 rows 189 cols
[2024-05-25 15:47:08] [INFO ] Computed 24 invariants in 2 ms
[2024-05-25 15:47:08] [INFO ] Implicit Places using invariants in 139 ms returned [94, 169, 180]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 140 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/193 places, 195/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 186/193 places, 195/199 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-11 finished in 550 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) U !p1)||X(G(p2))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 189 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 189 transition count 195
Applied a total of 8 rules in 5 ms. Remains 189 /193 variables (removed 4) and now considering 195/199 (removed 4) transitions.
// Phase 1: matrix 195 rows 189 cols
[2024-05-25 15:47:08] [INFO ] Computed 24 invariants in 1 ms
[2024-05-25 15:47:08] [INFO ] Implicit Places using invariants in 216 ms returned [169, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 217 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 195/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 187/193 places, 195/199 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (NOT p0), p1]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-13
Product exploration explored 100000 steps with 729 reset in 321 ms.
Stack based approach found an accepted trace after 14743 steps with 112 reset with depth 345 and stack size 345 in 66 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-13 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((p1 U p2)||(p2 U p3))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 193 transition count 169
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 163 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 161 transition count 167
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 64 place count 161 transition count 150
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 98 place count 144 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 141 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 141 transition count 147
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 186 place count 100 transition count 106
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 188 place count 99 transition count 105
Applied a total of 188 rules in 21 ms. Remains 99 /193 variables (removed 94) and now considering 105/199 (removed 94) transitions.
// Phase 1: matrix 105 rows 99 cols
[2024-05-25 15:47:09] [INFO ] Computed 24 invariants in 1 ms
[2024-05-25 15:47:09] [INFO ] Implicit Places using invariants in 124 ms returned [8, 51, 87, 93]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 132 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/193 places, 105/199 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 90 transition count 100
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 12 place count 89 transition count 99
Applied a total of 12 rules in 8 ms. Remains 89 /95 variables (removed 6) and now considering 99/105 (removed 6) transitions.
// Phase 1: matrix 99 rows 89 cols
[2024-05-25 15:47:09] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:47:09] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 15:47:09] [INFO ] Invariant cache hit.
[2024-05-25 15:47:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:09] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/193 places, 99/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 512 ms. Remains : 89/193 places, 99/199 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-15
Product exploration explored 100000 steps with 1725 reset in 206 ms.
Product exploration explored 100000 steps with 1773 reset in 222 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1)), (X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p2) p1 (NOT p3) p0)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (AND (NOT p2) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0))))]
Knowledge based reduction with 25 factoid took 574 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 15 to 11
RANDOM walk for 40000 steps (8 resets) in 391 ms. (102 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
[2024-05-25 15:47:11] [INFO ] Invariant cache hit.
[2024-05-25 15:47:11] [INFO ] State equation strengthened by 66 read => feed constraints.
Problem apf2 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 5/188 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/89 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1)), (X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1 p2 p3)), (G (OR p0 p1 p2)), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) p2 p3))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p2) p1 (NOT p3) p0)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (AND (NOT p2) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT p0)), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2))), (F p2), (F p3), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 29 factoid took 1015 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-25 15:47:12] [INFO ] Invariant cache hit.
[2024-05-25 15:47:13] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-25 15:47:13] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:47:13] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-25 15:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:47:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 15:47:13] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:47:13] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-25 15:47:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:47:13] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:47:14] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:14] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:47:14] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:47:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 806 ms
[2024-05-25 15:47:14] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 15:47:14] [INFO ] Added : 81 causal constraints over 17 iterations in 205 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-25 15:47:14] [INFO ] Invariant cache hit.
[2024-05-25 15:47:14] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-25 15:47:14] [INFO ] Invariant cache hit.
[2024-05-25 15:47:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:14] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-25 15:47:14] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-25 15:47:14] [INFO ] Invariant cache hit.
[2024-05-25 15:47:14] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 2/89 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:17] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
[2024-05-25 15:47:17] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-25 15:47:18] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:47:18] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 99/188 variables, 89/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6200 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 2/89 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 99/188 variables, 89/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 96/311 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 312 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4616 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 41/41 constraints]
After SMT, in 10841ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10843ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11207 ms. Remains : 89/89 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
Knowledge based reduction with 17 factoid took 485 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-05-25 15:47:26] [INFO ] Invariant cache hit.
[2024-05-25 15:47:26] [INFO ] State equation strengthened by 66 read => feed constraints.
Problem apf7 is UNSAT
After SMT solving in domain Real declared 5/188 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/89 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X p1)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 p3))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (F (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p1 p2))), (F p2), (F (NOT (OR (NOT p0) p1 p2 p3))), (F p3), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 837 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-25 15:47:27] [INFO ] Invariant cache hit.
[2024-05-25 15:47:27] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-25 15:47:27] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:47:27] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-25 15:47:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:47:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 15:47:27] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:47:27] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-25 15:47:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:27] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2024-05-25 15:47:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:47:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:27] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:47:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 840 ms
[2024-05-25 15:47:28] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 15:47:28] [INFO ] Added : 81 causal constraints over 17 iterations in 210 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1748 reset in 166 ms.
Product exploration explored 100000 steps with 1730 reset in 191 ms.
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-25 15:47:29] [INFO ] Invariant cache hit.
[2024-05-25 15:47:29] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-25 15:47:29] [INFO ] Invariant cache hit.
[2024-05-25 15:47:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:29] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-25 15:47:29] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-25 15:47:29] [INFO ] Invariant cache hit.
[2024-05-25 15:47:29] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:32] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 2/89 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:32] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:47:32] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:47:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:33] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:33] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 99/188 variables, 89/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6243 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 2/89 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 99/188 variables, 89/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 96/311 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:47:37] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 312 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4437 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 41/41 constraints]
After SMT, in 10700ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11042 ms. Remains : 89/89 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-15 finished in 30982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Found a Shortening insensitive property : ParamProductionCell-PT-5-LTLCardinality-00
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 193 transition count 167
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 161 transition count 167
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 64 place count 161 transition count 149
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 100 place count 143 transition count 149
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 138 transition count 144
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 138 transition count 144
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 188 place count 99 transition count 105
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 2 with 2 rules applied. Total rules applied 190 place count 98 transition count 104
Applied a total of 190 rules in 15 ms. Remains 98 /193 variables (removed 95) and now considering 104/199 (removed 95) transitions.
// Phase 1: matrix 104 rows 98 cols
[2024-05-25 15:47:40] [INFO ] Computed 24 invariants in 1 ms
[2024-05-25 15:47:40] [INFO ] Implicit Places using invariants in 108 ms returned [9, 51, 85, 92]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 111 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 94/193 places, 104/199 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 88 transition count 98
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 14 place count 87 transition count 97
Applied a total of 14 rules in 5 ms. Remains 87 /94 variables (removed 7) and now considering 97/104 (removed 7) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-05-25 15:47:40] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:47:41] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-25 15:47:41] [INFO ] Invariant cache hit.
[2024-05-25 15:47:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:41] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 87/193 places, 97/199 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 493 ms. Remains : 87/193 places, 97/199 transitions.
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-00
Product exploration explored 100000 steps with 6314 reset in 132 ms.
Product exploration explored 100000 steps with 6297 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 246 steps (0 resets) in 5 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 239 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-25 15:47:42] [INFO ] Invariant cache hit.
[2024-05-25 15:47:42] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-25 15:47:42] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:47:42] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-25 15:47:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:47:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 15:47:42] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:47:42] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-25 15:47:42] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2024-05-25 15:47:42] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:47:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 892 ms
[2024-05-25 15:47:43] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:47:43] [INFO ] Added : 67 causal constraints over 14 iterations in 203 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-25 15:47:43] [INFO ] Invariant cache hit.
[2024-05-25 15:47:44] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-25 15:47:44] [INFO ] Invariant cache hit.
[2024-05-25 15:47:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:44] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-25 15:47:44] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-25 15:47:44] [INFO ] Invariant cache hit.
[2024-05-25 15:47:44] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:47:45] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:47:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:46] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:47:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
[2024-05-25 15:47:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 2/87 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:47] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:47:47] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:47:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:47] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:48] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:47:49] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:49] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 97/184 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 17 (OVERLAPS) 0/184 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 215 constraints, problems are : Problem set: 0 solved, 94 unsolved in 7365 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/87 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 97/184 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 94/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:47:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/184 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/184 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 310 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5340 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 43/43 constraints]
After SMT, in 12727ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 12728ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13060 ms. Remains : 87/87 places, 97/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 129 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 265 steps (0 resets) in 10 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 299 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-25 15:47:58] [INFO ] Invariant cache hit.
[2024-05-25 15:47:58] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 15:47:58] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 15:47:58] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-25 15:47:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:47:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 15:47:58] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 15:47:58] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-25 15:47:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:47:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2024-05-25 15:47:58] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:47:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:47:58] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:47:58] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:47:58] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 5 ms to minimize.
[2024-05-25 15:47:58] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:47:58] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:47:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1291 ms
[2024-05-25 15:47:59] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:47:59] [INFO ] Added : 67 causal constraints over 14 iterations in 203 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 6303 reset in 134 ms.
Product exploration explored 100000 steps with 6240 reset in 160 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-25 15:48:00] [INFO ] Invariant cache hit.
[2024-05-25 15:48:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 15:48:00] [INFO ] Invariant cache hit.
[2024-05-25 15:48:00] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:48:00] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-25 15:48:00] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-25 15:48:00] [INFO ] Invariant cache hit.
[2024-05-25 15:48:00] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:48:01] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:48:02] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:03] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:48:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:48:03] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 2/87 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:03] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:48:03] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:48:04] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:04] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:05] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:48:05] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:06] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 97/184 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 17 (OVERLAPS) 0/184 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 215 constraints, problems are : Problem set: 0 solved, 94 unsolved in 7565 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/87 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 97/184 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 94/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 15:48:11] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/184 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/184 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 310 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5249 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 43/43 constraints]
After SMT, in 12836ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 12838ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13201 ms. Remains : 87/87 places, 97/97 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-00 finished in 33269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((p1 U p2)||(p2 U p3))))'
[2024-05-25 15:48:13] [INFO ] Flatten gal took : 16 ms
[2024-05-25 15:48:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-25 15:48:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 199 transitions and 614 arcs took 8 ms.
Total runtime 103729 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ParamProductionCell-PT-5
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 193
TRANSITIONS: 199
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.006s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2573
MODEL NAME: /home/mcc/execution/413/model
193 places, 199 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ParamProductionCell-PT-5-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-5-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716652109558
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="ParamProductionCell-PT-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ParamProductionCell-PT-5, 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 r267-smll-171654405600051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-5.tgz
mv ParamProductionCell-PT-5 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 '
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 ;