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-171654405500028.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-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405500028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 12 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-2-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716649352566

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:02:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:02:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:02:35] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-05-25 15:02:35] [INFO ] Transformed 231 places.
[2024-05-25 15:02:35] [INFO ] Transformed 202 transitions.
[2024-05-25 15:02:35] [INFO ] Found NUPN structural information;
[2024-05-25 15:02:35] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-2-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 160 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2024-05-25 15:02:36] [INFO ] Computed 59 invariants in 48 ms
[2024-05-25 15:02:36] [INFO ] Implicit Places using invariants in 765 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 42, 47, 64, 65, 73, 79, 117, 119, 120, 164, 166, 167, 192, 193, 197, 202, 218]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 830 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/231 places, 198/202 transitions.
Applied a total of 0 rules in 12 ms. Remains 202 /202 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1074 ms. Remains : 202/231 places, 198/202 transitions.
Support contains 48 out of 202 places after structural reductions.
[2024-05-25 15:02:37] [INFO ] Flatten gal took : 66 ms
[2024-05-25 15:02:37] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:02:37] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 46 out of 202 places (down from 48) after GAL structural reductions.
RANDOM walk for 33520 steps (7 resets) in 1387 ms. (24 steps per ms) remains 0/27 properties
FORMULA ParamProductionCell-PT-2-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(p0)||G((F(p1)&&F(G(p2))))))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 202 transition count 179
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 183 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 181 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 42 place count 181 transition count 165
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 66 place count 169 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 167 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 167 transition count 163
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 120 place count 142 transition count 138
Applied a total of 120 rules in 119 ms. Remains 142 /202 variables (removed 60) and now considering 138/198 (removed 60) transitions.
// Phase 1: matrix 138 rows 142 cols
[2024-05-25 15:02:38] [INFO ] Computed 34 invariants in 6 ms
[2024-05-25 15:02:38] [INFO ] Implicit Places using invariants in 339 ms returned [18, 32, 40, 51, 54, 67, 99, 100, 124, 128, 129]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 340 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/202 places, 138/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 131 transition count 134
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 127 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 125 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 125 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 123 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 121 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 121 transition count 128
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 40 place count 111 transition count 118
Applied a total of 40 rules in 33 ms. Remains 111 /131 variables (removed 20) and now considering 118/138 (removed 20) transitions.
// Phase 1: matrix 118 rows 111 cols
[2024-05-25 15:02:38] [INFO ] Computed 23 invariants in 1 ms
[2024-05-25 15:02:39] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-25 15:02:39] [INFO ] Invariant cache hit.
[2024-05-25 15:02:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:02:39] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/202 places, 118/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1073 ms. Remains : 111/202 places, 118/198 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-00
Product exploration explored 100000 steps with 838 reset in 626 ms.
Stack based approach found an accepted trace after 30475 steps with 349 reset with depth 1303 and stack size 883 in 96 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-00 finished in 2400 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)&&X(G(p1)))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 202 transition count 175
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 179 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 46 place count 179 transition count 163
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 70 place count 167 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 165 transition count 161
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 165 transition count 161
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 120 place count 142 transition count 138
Applied a total of 120 rules in 27 ms. Remains 142 /202 variables (removed 60) and now considering 138/198 (removed 60) transitions.
// Phase 1: matrix 138 rows 142 cols
[2024-05-25 15:02:40] [INFO ] Computed 34 invariants in 7 ms
[2024-05-25 15:02:41] [INFO ] Implicit Places using invariants in 226 ms returned [18, 21, 30, 38, 49, 50, 52, 64, 65, 99, 100, 124, 128, 129]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 227 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/202 places, 138/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 128 transition count 131
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 121 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 121 transition count 127
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 117 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 115 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 115 transition count 125
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 82 place count 87 transition count 97
Applied a total of 82 rules in 17 ms. Remains 87 /128 variables (removed 41) and now considering 97/138 (removed 41) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-05-25 15:02:41] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:02:41] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-25 15:02:41] [INFO ] Invariant cache hit.
[2024-05-25 15:02:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:02:41] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/202 places, 97/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 692 ms. Remains : 87/202 places, 97/198 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 149 steps with 0 reset with depth 150 and stack size 150 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-01 finished in 1141 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(((p1&&X(p1))||p0))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 13 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2024-05-25 15:02:41] [INFO ] Computed 34 invariants in 4 ms
[2024-05-25 15:02:42] [INFO ] Implicit Places using invariants in 319 ms returned [33, 37, 65, 84, 85, 87, 99, 100, 142, 143, 172, 177, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 323 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 12 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:02:42] [INFO ] Computed 21 invariants in 3 ms
[2024-05-25 15:02:42] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-25 15:02:42] [INFO ] Invariant cache hit.
[2024-05-25 15:02:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:02:42] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 988 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 115 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-2-LTLFireability-02
Product exploration explored 100000 steps with 383 reset in 233 ms.
Product exploration explored 100000 steps with 367 reset in 243 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 332 ms. (120 steps per ms) remains 1/4 properties
BEST_FIRST walk for 1707 steps (0 resets) in 19 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 15:02:44] [INFO ] Invariant cache hit.
[2024-05-25 15:02:44] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-25 15:02:44] [INFO ] Invariant cache hit.
[2024-05-25 15:02:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:02:45] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-25 15:02:45] [INFO ] Invariant cache hit.
[2024-05-25 15:02:45] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:02:47] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 28 ms to minimize.
[2024-05-25 15:02:47] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 3 ms to minimize.
[2024-05-25 15:02:47] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 3 ms to minimize.
[2024-05-25 15:02:47] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 3 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 3 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 4 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 4 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 3 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:02:48] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 3 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:02:49] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:02:50] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:02:51] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:02:51] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:02:51] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:02:51] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-25 15:02:51] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:02:52] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:02:52] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:02:52] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:02:52] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:02:53] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:02:54] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 2/184 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:02:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:02:59] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:02:59] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:02:59] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-25 15:03:00] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-25 15:03:00] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:03:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:03:04] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (OVERLAPS) 194/379 variables, 185/253 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 68/321 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 321 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 43/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 2/184 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 194/379 variables, 185/253 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 68/321 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 192/513 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 14 (OVERLAPS) 0/379 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 513 constraints, problems are : Problem set: 0 solved, 192 unsolved in 21780 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 47/47 constraints]
After SMT, in 51899ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 52032ms
Finished structural reductions in LTL mode , in 1 iterations and 52833 ms. Remains : 185/185 places, 194/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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/4 properties
BEST_FIRST walk for 1700 steps (0 resets) in 11 ms. (141 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 366 reset in 201 ms.
Product exploration explored 100000 steps with 374 reset in 227 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 15:03:39] [INFO ] Invariant cache hit.
[2024-05-25 15:03:39] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-25 15:03:39] [INFO ] Invariant cache hit.
[2024-05-25 15:03:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:03:39] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-25 15:03:40] [INFO ] Invariant cache hit.
[2024-05-25 15:03:40] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 3 ms to minimize.
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 4 ms to minimize.
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 3 ms to minimize.
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-25 15:03:41] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 3 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 3 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:03:42] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 4 ms to minimize.
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:03:43] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:03:44] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:03:44] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-25 15:03:44] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:03:44] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:03:44] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:03:44] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:03:45] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:03:45] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 3 ms to minimize.
[2024-05-25 15:03:45] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:03:46] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-25 15:03:46] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-25 15:03:47] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:03:47] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:03:47] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:03:50] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 2/184 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:03:55] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:03:55] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:03:55] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:03:55] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 3 ms to minimize.
[2024-05-25 15:03:56] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:03:56] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-25 15:03:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:03:59] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (OVERLAPS) 194/379 variables, 185/253 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 68/321 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 321 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 43/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 2/184 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 194/379 variables, 185/253 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 68/321 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 192/513 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 14 (OVERLAPS) 0/379 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 513 constraints, problems are : Problem set: 0 solved, 192 unsolved in 19228 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 47/47 constraints]
After SMT, in 49302ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 49306ms
Finished structural reductions in LTL mode , in 1 iterations and 49964 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 107472 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 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 202 transition count 179
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 183 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 181 transition count 177
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 42 place count 181 transition count 163
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 70 place count 167 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 165 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 165 transition count 161
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 120 place count 142 transition count 138
Applied a total of 120 rules in 21 ms. Remains 142 /202 variables (removed 60) and now considering 138/198 (removed 60) transitions.
// Phase 1: matrix 138 rows 142 cols
[2024-05-25 15:04:29] [INFO ] Computed 34 invariants in 3 ms
[2024-05-25 15:04:29] [INFO ] Implicit Places using invariants in 192 ms returned [23, 32, 40, 51, 52, 54, 66, 67, 99, 100, 124, 128, 129]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 195 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/202 places, 138/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 129 transition count 130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 121 transition count 130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 121 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 118 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 116 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 116 transition count 125
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 80 place count 89 transition count 98
Applied a total of 80 rules in 14 ms. Remains 89 /129 variables (removed 40) and now considering 98/138 (removed 40) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 15:04:29] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:04:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-25 15:04:29] [INFO ] Invariant cache hit.
[2024-05-25 15:04:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:29] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/202 places, 98/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 538 ms. Remains : 89/202 places, 98/198 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 142 steps with 0 reset with depth 143 and stack size 143 in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-03 finished in 719 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(p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 4 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2024-05-25 15:04:30] [INFO ] Computed 34 invariants in 5 ms
[2024-05-25 15:04:30] [INFO ] Implicit Places using invariants in 217 ms returned [33, 37, 49, 65, 84, 85, 87, 99, 142, 143, 172, 177, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 218 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:04:30] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:04:30] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-25 15:04:30] [INFO ] Invariant cache hit.
[2024-05-25 15:04:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:30] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 746 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-04 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((F(p0)&&F(G(p1)))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 202 transition count 177
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 181 transition count 177
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 42 place count 181 transition count 164
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 68 place count 168 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 166 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 166 transition count 162
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 118 place count 143 transition count 139
Applied a total of 118 rules in 15 ms. Remains 143 /202 variables (removed 59) and now considering 139/198 (removed 59) transitions.
// Phase 1: matrix 139 rows 143 cols
[2024-05-25 15:04:30] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:04:31] [INFO ] Implicit Places using invariants in 246 ms returned [21, 24, 33, 41, 52, 53, 55, 67, 68, 100, 101, 125, 129, 130]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 249 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/202 places, 139/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 129 transition count 131
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 121 transition count 131
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 121 transition count 128
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 118 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 116 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 116 transition count 126
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 84 place count 87 transition count 97
Applied a total of 84 rules in 9 ms. Remains 87 /129 variables (removed 42) and now considering 97/139 (removed 42) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-05-25 15:04:31] [INFO ] Computed 20 invariants in 0 ms
[2024-05-25 15:04:31] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-25 15:04:31] [INFO ] Invariant cache hit.
[2024-05-25 15:04:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:31] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/202 places, 97/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 609 ms. Remains : 87/202 places, 97/198 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 123 ms.
Stack based approach found an accepted trace after 261 steps with 1 reset with depth 227 and stack size 227 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-05 finished in 870 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)&&(G(!p1)||(!p1&&F(p2)))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 202 transition count 178
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 182 transition count 178
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 40 place count 182 transition count 167
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 62 place count 171 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 169 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 169 transition count 165
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 110 place count 147 transition count 143
Applied a total of 110 rules in 14 ms. Remains 147 /202 variables (removed 55) and now considering 143/198 (removed 55) transitions.
// Phase 1: matrix 143 rows 147 cols
[2024-05-25 15:04:31] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:04:32] [INFO ] Implicit Places using invariants in 255 ms returned [19, 22, 31, 39, 52, 53, 55, 67, 68, 100, 132, 133]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 257 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/202 places, 143/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 135 transition count 140
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 132 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 130 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 130 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 20 place count 125 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 123 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 123 transition count 131
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 66 place count 102 transition count 110
Applied a total of 66 rules in 12 ms. Remains 102 /135 variables (removed 33) and now considering 110/143 (removed 33) transitions.
// Phase 1: matrix 110 rows 102 cols
[2024-05-25 15:04:32] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 15:04:32] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-25 15:04:32] [INFO ] Invariant cache hit.
[2024-05-25 15:04:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:32] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/202 places, 110/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 605 ms. Remains : 102/202 places, 110/198 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) p1), true, (NOT p0), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-06
Product exploration explored 100000 steps with 3329 reset in 133 ms.
Product exploration explored 100000 steps with 3355 reset in 151 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 p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 150 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter insensitive) to 10 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 514 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (NOT p2), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
[2024-05-25 15:04:33] [INFO ] Invariant cache hit.
[2024-05-25 15:04:33] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/71 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf11 is UNSAT
After SMT solving in domain Real declared 76/212 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 9/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/102 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p2), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 12 factoid took 681 ms. Reduced automaton from 10 states, 27 edges and 3 AP (stutter insensitive) to 10 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 755 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (NOT p2), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (NOT p2), false, false, false, false, false, false]
[2024-05-25 15:04:35] [INFO ] Invariant cache hit.
[2024-05-25 15:04:35] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-25 15:04:35] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-25 15:04:35] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-25 15:04:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:04:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-25 15:04:36] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 15:04:36] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-25 15:04:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:36] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 417 ms
[2024-05-25 15:04:36] [INFO ] Computed and/alt/rep : 108/237/108 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:04:37] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:04:37] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:04:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 237 ms
[2024-05-25 15:04:37] [INFO ] Added : 97 causal constraints over 21 iterations in 594 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-25 15:04:37] [INFO ] Invariant cache hit.
[2024-05-25 15:04:37] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-25 15:04:37] [INFO ] Invariant cache hit.
[2024-05-25 15:04:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:37] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-25 15:04:37] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-25 15:04:37] [INFO ] Invariant cache hit.
[2024-05-25 15:04:37] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:04:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:04:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:40] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:40] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 4/102 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:41] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:04:41] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:04:41] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:04:41] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:04:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:04:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:04:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:04:42] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:42] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:42] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:04:42] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:04:43] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:43] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:04:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:44] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:04:44] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 110/212 variables, 102/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 68/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 0/212 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 239 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10783 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 110/212 variables, 102/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 68/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 108/347 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 347 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5151 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 47/47 constraints]
After SMT, in 15962ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 15964ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16317 ms. Remains : 102/102 places, 110/110 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 p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (NOT (AND p1 p2 p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 207 ms. Reduced automaton from 10 states, 27 edges and 3 AP (stutter insensitive) to 10 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (NOT p2), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-05-25 15:04:54] [INFO ] Invariant cache hit.
[2024-05-25 15:04:54] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/71 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf11 is UNSAT
After SMT solving in domain Real declared 76/212 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 9/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/102 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (NOT (AND p1 p2 p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2 p0)))), (G (OR (NOT p1) (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p2), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 24 factoid took 526 ms. Reduced automaton from 10 states, 27 edges and 3 AP (stutter insensitive) to 10 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (NOT p2), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (NOT p2), false, false, false, false, false, false]
[2024-05-25 15:04:55] [INFO ] Invariant cache hit.
[2024-05-25 15:04:55] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-25 15:04:55] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:04:55] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-25 15:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:04:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-25 15:04:55] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:04:56] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-25 15:04:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:56] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 373 ms
[2024-05-25 15:04:56] [INFO ] Computed and/alt/rep : 108/237/108 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:04:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2024-05-25 15:04:56] [INFO ] Added : 97 causal constraints over 21 iterations in 577 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (NOT p2), false, false, false, false, false, false]
Product exploration explored 100000 steps with 3354 reset in 138 ms.
Product exploration explored 100000 steps with 3357 reset in 157 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-25 15:04:57] [INFO ] Invariant cache hit.
[2024-05-25 15:04:57] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-25 15:04:57] [INFO ] Invariant cache hit.
[2024-05-25 15:04:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:04:58] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-25 15:04:58] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-25 15:04:58] [INFO ] Invariant cache hit.
[2024-05-25 15:04:58] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:58] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:04:59] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:05:00] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:05:00] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:05:01] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 4/102 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:02] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:05:03] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:05:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:03] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:05:04] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-25 15:05:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:05] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 110/212 variables, 102/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 68/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 0/212 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 239 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10759 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 110/212 variables, 102/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 68/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 108/347 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 347 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4874 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 47/47 constraints]
After SMT, in 15664ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 15666ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16117 ms. Remains : 102/102 places, 110/110 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-06 finished in 42003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 3 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2024-05-25 15:05:13] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:05:14] [INFO ] Implicit Places using invariants in 267 ms returned [33, 37, 49, 65, 84, 85, 87, 99, 100, 142, 143, 177, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 269 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:05:14] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:05:14] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-25 15:05:14] [INFO ] Invariant cache hit.
[2024-05-25 15:05:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:14] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 865 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-08
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-08 finished in 1111 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) U (p1||(G(F(G(p0)))&&X(p1))))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 202 transition count 181
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 185 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 183 transition count 179
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 38 place count 183 transition count 167
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 171 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 169 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 169 transition count 165
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 116 place count 144 transition count 140
Applied a total of 116 rules in 20 ms. Remains 144 /202 variables (removed 58) and now considering 140/198 (removed 58) transitions.
// Phase 1: matrix 140 rows 144 cols
[2024-05-25 15:05:14] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:05:15] [INFO ] Implicit Places using invariants in 222 ms returned [18, 32, 40, 51, 52, 54, 66, 67, 99, 100, 129, 130]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 224 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/202 places, 140/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 132 transition count 134
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 126 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 124 transition count 132
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 16 place count 124 transition count 126
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 28 place count 118 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 116 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 116 transition count 124
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 76 place count 94 transition count 102
Applied a total of 76 rules in 9 ms. Remains 94 /132 variables (removed 38) and now considering 102/140 (removed 38) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-25 15:05:15] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 15:05:15] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-25 15:05:15] [INFO ] Invariant cache hit.
[2024-05-25 15:05:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:15] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/202 places, 102/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 642 ms. Remains : 94/202 places, 102/198 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-09
Product exploration explored 100000 steps with 3134 reset in 130 ms.
Product exploration explored 100000 steps with 3125 reset in 151 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 111 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2024-05-25 15:05:16] [INFO ] Invariant cache hit.
[2024-05-25 15:05:16] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-25 15:05:16] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 15:05:16] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-25 15:05:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:05:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-25 15:05:16] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 15:05:16] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-25 15:05:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:16] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:05:16] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:05:17] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 839 ms
[2024-05-25 15:05:17] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:05:17] [INFO ] Added : 88 causal constraints over 19 iterations in 248 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-25 15:05:17] [INFO ] Invariant cache hit.
[2024-05-25 15:05:17] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-25 15:05:17] [INFO ] Invariant cache hit.
[2024-05-25 15:05:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:18] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-25 15:05:18] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 15:05:18] [INFO ] Invariant cache hit.
[2024-05-25 15:05:18] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:18] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 3 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
[2024-05-25 15:05:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:20] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:21] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:05:21] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:05:21] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:21] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:05:21] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:22] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:22] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 102/196 variables, 94/162 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 68/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/196 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 230 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6834 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 4/94 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:05:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 102/196 variables, 94/163 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 68/231 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 100/331 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-25 15:05:27] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/196 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 332 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5346 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 48/48 constraints]
After SMT, in 12200ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12202ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12569 ms. Remains : 94/94 places, 102/102 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
RANDOM walk for 134 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2024-05-25 15:05:30] [INFO ] Invariant cache hit.
[2024-05-25 15:05:30] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-25 15:05:30] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:05:30] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-25 15:05:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:05:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-25 15:05:30] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 15:05:30] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-25 15:05:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:30] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2024-05-25 15:05:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:05:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 860 ms
[2024-05-25 15:05:31] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:05:32] [INFO ] Added : 88 causal constraints over 19 iterations in 245 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3126 reset in 121 ms.
Product exploration explored 100000 steps with 3138 reset in 141 ms.
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 92 transition count 100
Applied a total of 4 rules in 3 ms. Remains 92 /94 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 92 cols
[2024-05-25 15:05:32] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 15:05:32] [INFO ] Implicit Places using invariants in 135 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/94 places, 100/102 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 91 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 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 4 place count 89 transition count 98
Applied a total of 4 rules in 5 ms. Remains 89 /91 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 15:05:32] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:05:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 15:05:32] [INFO ] Invariant cache hit.
[2024-05-25 15:05:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:32] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/94 places, 98/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 490 ms. Remains : 89/94 places, 98/102 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-09 finished in 17907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 4 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2024-05-25 15:05:32] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:05:33] [INFO ] Implicit Places using invariants in 251 ms returned [33, 37, 49, 65, 85, 87, 100, 101, 143, 144, 173, 178, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 252 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 188/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 138 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-2-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-10 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 4 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2024-05-25 15:05:33] [INFO ] Computed 34 invariants in 5 ms
[2024-05-25 15:05:33] [INFO ] Implicit Places using invariants in 194 ms returned [33, 37, 49, 65, 84, 85, 87, 99, 100, 142, 143, 172, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 195 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:05:33] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:05:33] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-25 15:05:33] [INFO ] Invariant cache hit.
[2024-05-25 15:05:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:34] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 765 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 156 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-2-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-11 finished in 1191 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 X(p2))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 3 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2024-05-25 15:05:34] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:05:34] [INFO ] Implicit Places using invariants in 208 ms returned [33, 37, 49, 65, 84, 85, 99, 143, 173, 178, 182]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 210 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/202 places, 197/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 190/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-14 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 4 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2024-05-25 15:05:35] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:05:35] [INFO ] Implicit Places using invariants in 253 ms returned [33, 37, 49, 65, 84, 85, 87, 99, 143, 172, 177, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 254 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 3 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-25 15:05:35] [INFO ] Computed 22 invariants in 0 ms
[2024-05-25 15:05:35] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 15:05:35] [INFO ] Invariant cache hit.
[2024-05-25 15:05:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:35] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 723 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 135 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 p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-2-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-15 finished in 1111 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(((p1&&X(p1))||p0))))'
Found a Shortening insensitive property : ParamProductionCell-PT-2-LTLFireability-02
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 202 transition count 175
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 179 transition count 175
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 46 place count 179 transition count 164
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 168 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 166 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 166 transition count 162
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 118 place count 143 transition count 139
Applied a total of 118 rules in 17 ms. Remains 143 /202 variables (removed 59) and now considering 139/198 (removed 59) transitions.
// Phase 1: matrix 139 rows 143 cols
[2024-05-25 15:05:36] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 15:05:36] [INFO ] Implicit Places using invariants in 243 ms returned [18, 21, 40, 52, 53, 55, 67, 68, 100, 101, 125, 129, 130]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 253 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/202 places, 139/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 130 transition count 132
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 123 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 123 transition count 128
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 119 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 117 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 117 transition count 126
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 82 place count 89 transition count 98
Applied a total of 82 rules in 6 ms. Remains 89 /130 variables (removed 41) and now considering 98/139 (removed 41) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 15:05:36] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:05:36] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-25 15:05:36] [INFO ] Invariant cache hit.
[2024-05-25 15:05:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:37] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 89/202 places, 98/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 618 ms. Remains : 89/202 places, 98/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-02
Product exploration explored 100000 steps with 796 reset in 131 ms.
Product exploration explored 100000 steps with 836 reset in 152 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 23078 steps (4 resets) in 41 ms. (549 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-25 15:05:38] [INFO ] Invariant cache hit.
[2024-05-25 15:05:38] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-25 15:05:38] [INFO ] Invariant cache hit.
[2024-05-25 15:05:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:38] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-25 15:05:38] [INFO ] Invariant cache hit.
[2024-05-25 15:05:38] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 3/88 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:05:42] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:42] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:42] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 1/89 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:43] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:05:43] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:05:44] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 98/187 variables, 89/154 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 68/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 222 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8327 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 3/88 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:48] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 98/187 variables, 89/155 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 68/223 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 96/319 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 319 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4423 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 45/45 constraints]
After SMT, in 12773ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12774ms
Finished structural reductions in LTL mode , in 1 iterations and 13164 ms. Remains : 89/89 places, 98/98 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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 23878 steps (5 resets) in 40 ms. (582 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 232 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 823 reset in 133 ms.
Product exploration explored 100000 steps with 828 reset in 150 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-25 15:05:52] [INFO ] Invariant cache hit.
[2024-05-25 15:05:52] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-25 15:05:52] [INFO ] Invariant cache hit.
[2024-05-25 15:05:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:05:52] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-25 15:05:52] [INFO ] Invariant cache hit.
[2024-05-25 15:05:52] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:53] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:05:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:05:55] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:55] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 3/88 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:57] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 1/89 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:05:58] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:05:58] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 2 ms to minimize.
[2024-05-25 15:05:58] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 98/187 variables, 89/154 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 68/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 222 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8317 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 3/88 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 15:06:02] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 98/187 variables, 89/155 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 68/223 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 96/319 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 319 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4345 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 45/45 constraints]
After SMT, in 12682ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 12683ms
Finished structural reductions in LTL mode , in 1 iterations and 12994 ms. Remains : 89/89 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 29363 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)&&(G(!p1)||(!p1&&F(p2)))))'
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) U (p1||(G(F(G(p0)))&&X(p1))))))'
[2024-05-25 15:06:05] [INFO ] Flatten gal took : 18 ms
[2024-05-25 15:06:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-25 15:06:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 198 transitions and 734 arcs took 5 ms.
Total runtime 211000 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-2

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 202
TRANSITIONS: 198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
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: 2961
MODEL NAME: /home/mcc/execution/411/model
202 places, 198 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-2-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-2-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-2-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716649577243

--------------------
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 LTLFireability -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-2"
export BK_EXAMINATION="LTLFireability"
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-2, examination is LTLFireability"
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-171654405500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;