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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717244352940

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:19:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:19:15] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-06-01 12:19:16] [INFO ] Transformed 231 places.
[2024-06-01 12:19:16] [INFO ] Transformed 202 transitions.
[2024-06-01 12:19:16] [INFO ] Found NUPN structural information;
[2024-06-01 12:19:16] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 101 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2024-06-01 12:19:16] [INFO ] Computed 59 invariants in 44 ms
[2024-06-01 12:19:17] [INFO ] Implicit Places using invariants in 968 ms returned [15, 16, 18, 31, 35, 36, 41, 46, 47, 59, 64, 73, 79, 101, 114, 116, 118, 119, 159, 162, 190, 191, 194, 195, 200, 201, 216]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/231 places, 196/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1239 ms. Remains : 198/231 places, 196/202 transitions.
Support contains 51 out of 198 places after structural reductions.
[2024-06-01 12:19:18] [INFO ] Flatten gal took : 91 ms
[2024-06-01 12:19:18] [INFO ] Flatten gal took : 37 ms
[2024-06-01 12:19:18] [INFO ] Input system was already deterministic with 196 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 1409 ms. (28 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 1/1 properties
// Phase 1: matrix 196 rows 198 cols
[2024-06-01 12:19:18] [INFO ] Computed 32 invariants in 10 ms
[2024-06-01 12:19:18] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 109/394 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/23 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/198 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ParamProductionCell-PT-5-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ParamProductionCell-PT-5-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(!p1 U (p2||G(!p1)))))'
Support contains 8 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-06-01 12:19:19] [INFO ] Invariant cache hit.
[2024-06-01 12:19:19] [INFO ] Implicit Places using invariants in 237 ms returned [16, 21, 35, 54, 66, 85, 99, 144, 145, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 240 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 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 20 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-06-01 12:19:19] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 12:19:19] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 12:19:19] [INFO ] Invariant cache hit.
[2024-06-01 12:19:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:19:20] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1135 ms. Remains : 186/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 480 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-00 finished in 1708 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))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 50 place count 173 transition count 158
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 76 place count 160 transition count 158
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 130 place count 133 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 132 transition count 130
Applied a total of 132 rules in 78 ms. Remains 132 /198 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 132 cols
[2024-06-01 12:19:21] [INFO ] Computed 32 invariants in 3 ms
[2024-06-01 12:19:21] [INFO ] Implicit Places using invariants in 251 ms returned [9, 12, 22, 34, 41, 51, 52, 64, 95, 98, 99, 122]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 255 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 130/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 127
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 60 place count 90 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 89 transition count 99
Applied a total of 62 rules in 39 ms. Remains 89 /120 variables (removed 31) and now considering 99/130 (removed 31) transitions.
// Phase 1: matrix 99 rows 89 cols
[2024-06-01 12:19:21] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 12:19:21] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 12:19:21] [INFO ] Invariant cache hit.
[2024-06-01 12:19:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:19:21] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/198 places, 99/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 792 ms. Remains : 89/198 places, 99/196 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, p0]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-01
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G(!p1)) U p1))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 50 place count 173 transition count 157
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 159 transition count 157
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 128 place count 134 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 133 transition count 131
Applied a total of 130 rules in 29 ms. Remains 133 /198 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 133 cols
[2024-06-01 12:19:22] [INFO ] Computed 32 invariants in 5 ms
[2024-06-01 12:19:22] [INFO ] Implicit Places using invariants in 206 ms returned [8, 11, 21, 33, 40, 50, 64, 95, 98, 99, 123]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 208 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 131/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 120 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 120 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 119 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 117 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 117 transition count 126
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 36 place count 104 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 103 transition count 112
Applied a total of 38 rules in 23 ms. Remains 103 /122 variables (removed 19) and now considering 112/131 (removed 19) transitions.
// Phase 1: matrix 112 rows 103 cols
[2024-06-01 12:19:22] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:19:22] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 12:19:22] [INFO ] Invariant cache hit.
[2024-06-01 12:19:22] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:19:22] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/198 places, 112/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 866 ms. Remains : 103/198 places, 112/196 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-04
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-04 finished in 1038 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(F(p0)))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-06-01 12:19:23] [INFO ] Computed 32 invariants in 3 ms
[2024-06-01 12:19:23] [INFO ] Implicit Places using invariants in 198 ms returned [16, 21, 35, 54, 66, 85, 86, 99, 141, 144, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 203 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/196 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 8 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:19:23] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 12:19:23] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 12:19:23] [INFO ] Invariant cache hit.
[2024-06-01 12:19:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:19:23] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 893 ms. Remains : 185/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07
Product exploration explored 100000 steps with 1408 reset in 674 ms.
Product exploration explored 100000 steps with 1407 reset in 416 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 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 242 steps (0 resets) in 8 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 12:19:26] [INFO ] Invariant cache hit.
[2024-06-01 12:19:26] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-06-01 12:19:26] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 12:19:26] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2024-06-01 12:19:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:19:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-06-01 12:19:27] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 12:19:27] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2024-06-01 12:19:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:19:27] [INFO ] [Nat]Added 68 Read/Feed constraints in 73 ms returned sat
[2024-06-01 12:19:28] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 10 ms to minimize.
[2024-06-01 12:19:28] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 4 ms to minimize.
[2024-06-01 12:19:28] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-06-01 12:19:28] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 3 ms to minimize.
[2024-06-01 12:19:28] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 3 ms to minimize.
[2024-06-01 12:19:28] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-06-01 12:19:29] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 5 ms to minimize.
[2024-06-01 12:19:29] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:19:29] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-06-01 12:19:29] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:19:29] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:19:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1781 ms
[2024-06-01 12:19:29] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 35 ms.
[2024-06-01 12:19:31] [INFO ] Added : 164 causal constraints over 33 iterations in 1571 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-06-01 12:19:31] [INFO ] Invariant cache hit.
[2024-06-01 12:19:31] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 12:19:31] [INFO ] Invariant cache hit.
[2024-06-01 12:19:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:19:31] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-06-01 12:19:31] [INFO ] Invariant cache hit.
[2024-06-01 12:19:31] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:19:33] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 3 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:19:34] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 3 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:19:36] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:19:36] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:19:36] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:19:36] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:19:36] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:19:37] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:19:37] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:19:39] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:19:40] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 5/184 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:19:43] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 4 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:19:44] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:19:45] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 3 ms to minimize.
[2024-06-01 12:19:45] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:19:46] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 6 ms to minimize.
[2024-06-01 12:19:46] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:19:46] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 19/68 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:19:47] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:19:47] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:19:50] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:19:52] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (OVERLAPS) 194/379 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 326 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 5/184 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:20:07] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 189/516 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (OVERLAPS) 0/379 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 519 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 56/56 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in LTL mode , in 1 iterations and 60930 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 314 steps (0 resets) in 7 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 12:20:33] [INFO ] Invariant cache hit.
[2024-06-01 12:20:33] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-06-01 12:20:33] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 12:20:33] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-06-01 12:20:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:20:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-06-01 12:20:33] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:20:34] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2024-06-01 12:20:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:20:34] [INFO ] [Nat]Added 68 Read/Feed constraints in 63 ms returned sat
[2024-06-01 12:20:34] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 4 ms to minimize.
[2024-06-01 12:20:34] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-06-01 12:20:34] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-06-01 12:20:34] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 3 ms to minimize.
[2024-06-01 12:20:35] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 3 ms to minimize.
[2024-06-01 12:20:35] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-06-01 12:20:35] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-06-01 12:20:35] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-06-01 12:20:35] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-06-01 12:20:35] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:20:36] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:20:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1748 ms
[2024-06-01 12:20:36] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 12:20:37] [INFO ] Added : 164 causal constraints over 33 iterations in 1203 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1414 reset in 128 ms.
Product exploration explored 100000 steps with 1423 reset in 336 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 185 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 37 place count 185 transition count 196
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 185 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 177 transition count 187
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 177 transition count 187
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 107 place count 177 transition count 187
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 132 place count 152 transition count 162
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 157 place count 152 transition count 162
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 157 rules in 37 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2024-06-01 12:20:38] [INFO ] Redundant transitions in 5 ms returned []
Running 159 sub problems to find dead transitions.
// Phase 1: matrix 162 rows 152 cols
[2024-06-01 12:20:38] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:20:38] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:20:39] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 18/34 constraints. Problems are: Problem set: 44 solved, 115 unsolved
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:20:40] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:20:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:20:41] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 5/39 constraints. Problems are: Problem set: 44 solved, 115 unsolved
[2024-06-01 12:20:41] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/40 constraints. Problems are: Problem set: 44 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/40 constraints. Problems are: Problem set: 44 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 3/151 variables, 3/43 constraints. Problems are: Problem set: 44 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/44 constraints. Problems are: Problem set: 44 solved, 115 unsolved
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-06-01 12:20:43] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:20:44] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
[2024-06-01 12:20:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:20:44] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:20:44] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 20/64 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:20:44] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:20:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:20:44] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 3/67 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/67 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/68 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:20:46] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/69 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/69 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 162/314 variables, 152/221 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 68/289 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 0/289 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/314 variables, 0/289 constraints. Problems are: Problem set: 59 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 289 constraints, problems are : Problem set: 59 solved, 100 unsolved in 11895 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 59 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 10/10 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 36/46 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/46 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 61/151 variables, 8/54 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 2/56 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 12/68 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/68 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/69 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:20:51] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:20:52] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 2/71 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/71 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 162/314 variables, 152/223 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 68/291 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 100/391 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:20:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 1/392 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:20:56] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 1/393 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/393 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:21:01] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/314 variables, 1/394 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:21:03] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/314 variables, 1/395 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/314 variables, 0/395 constraints. Problems are: Problem set: 59 solved, 100 unsolved
[2024-06-01 12:21:07] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/314 variables, 1/396 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/314 variables, 0/396 constraints. Problems are: Problem set: 59 solved, 100 unsolved
At refinement iteration 21 (OVERLAPS) 0/314 variables, 0/396 constraints. Problems are: Problem set: 59 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 396 constraints, problems are : Problem set: 59 solved, 100 unsolved in 22582 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 100/159 constraints, Known Traps: 55/55 constraints]
After SMT, in 34520ms problems are : Problem set: 59 solved, 100 unsolved
Search for dead transitions found 59 dead transitions in 34525ms
Found 59 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 59 transitions
Dead transitions reduction (with SMT) removed 59 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 103/194 transitions.
Graph (complete) has 310 edges and 152 vertex of which 94 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.2 ms
Discarding 58 places :
Also discarding 0 output transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 94 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 94 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 13 ms. Remains 94 /152 variables (removed 58) and now considering 103/103 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/185 places, 103/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34590 ms. Remains : 94/185 places, 103/194 transitions.
Support contains 2 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 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:21:12] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:21:13] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 12:21:13] [INFO ] Invariant cache hit.
[2024-06-01 12:21:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:21:13] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-06-01 12:21:13] [INFO ] Invariant cache hit.
[2024-06-01 12:21:13] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:14] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:21:14] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:21:14] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:21:14] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:21:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:21:14] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:21:14] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 2 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:21:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:18] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:21:18] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 5/184 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:21:20] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:21:21] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:21:22] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:21:22] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:21:22] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:21:22] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 19/68 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:23] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:21:23] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:24] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:26] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (OVERLAPS) 194/379 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/379 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 326 constraints, problems are : Problem set: 0 solved, 189 unsolved in 29396 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 5/184 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:46] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 189/516 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-01 12:21:51] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:21:51] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:21:51] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (OVERLAPS) 0/379 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 519 constraints, problems are : Problem set: 0 solved, 189 unsolved in 22518 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 56/56 constraints]
After SMT, in 51952ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 51956ms
Finished structural reductions in LTL mode , in 1 iterations and 52484 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 162448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-06-01 12:22:05] [INFO ] Computed 32 invariants in 1 ms
[2024-06-01 12:22:05] [INFO ] Implicit Places using invariants in 250 ms returned [16, 21, 35, 54, 66, 85, 86, 99, 141, 144, 145, 179]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 252 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 9 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-06-01 12:22:05] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 12:22:05] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 12:22:05] [INFO ] Invariant cache hit.
[2024-06-01 12:22:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:22:06] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 833 ms. Remains : 184/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-08
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-08 finished in 1033 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)||p0)))'
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 198 transition count 172
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 174 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 50 place count 173 transition count 157
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 159 transition count 157
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 132 place count 132 transition count 130
Applied a total of 132 rules in 27 ms. Remains 132 /198 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 132 cols
[2024-06-01 12:22:06] [INFO ] Computed 32 invariants in 2 ms
[2024-06-01 12:22:06] [INFO ] Implicit Places using invariants in 270 ms returned [9, 37, 44, 55, 56, 68, 95, 98, 99, 122]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 272 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 130/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 120 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 120 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 119 transition count 127
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 2 with 50 rules applied. Total rules applied 56 place count 94 transition count 102
Applied a total of 56 rules in 16 ms. Remains 94 /122 variables (removed 28) and now considering 102/130 (removed 28) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-06-01 12:22:06] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 12:22:06] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 12:22:07] [INFO ] Invariant cache hit.
[2024-06-01 12:22:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:22:07] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/198 places, 102/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 815 ms. Remains : 94/198 places, 102/196 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09
Product exploration explored 100000 steps with 73 reset in 377 ms.
Product exploration explored 100000 steps with 86 reset in 458 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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1315 steps (0 resets) in 12 ms. (101 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 12:22:08] [INFO ] Invariant cache hit.
[2024-06-01 12:22:09] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 12:22:09] [INFO ] Invariant cache hit.
[2024-06-01 12:22:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:22:09] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-06-01 12:22:09] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:22:09] [INFO ] Invariant cache hit.
[2024-06-01 12:22:09] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:22:10] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:22:11] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/93 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:12] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:22:12] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:22:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:22:12] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:22:13] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:22:14] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:22:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:22:15] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:22:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:16] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:22:16] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 102/196 variables, 94/166 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 68/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 234 constraints, problems are : Problem set: 0 solved, 99 unsolved in 10892 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/93 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 102/196 variables, 94/167 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 68/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 99/334 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:23] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:25] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/196 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/196 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 336 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8764 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 53/53 constraints]
After SMT, in 19689ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 19692ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20211 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 : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 3772 steps (0 resets) in 17 ms. (209 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 100 reset in 146 ms.
Product exploration explored 100000 steps with 101 reset in 564 ms.
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 12:22:30] [INFO ] Invariant cache hit.
[2024-06-01 12:22:30] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 12:22:30] [INFO ] Invariant cache hit.
[2024-06-01 12:22:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:22:30] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-06-01 12:22:30] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:22:30] [INFO ] Invariant cache hit.
[2024-06-01 12:22:31] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 6 ms to minimize.
[2024-06-01 12:22:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:22:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/93 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:22:33] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:22:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:35] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:22:35] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:22:35] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:22:35] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:22:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:22:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:22:36] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 102/196 variables, 94/166 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 68/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 234 constraints, problems are : Problem set: 0 solved, 99 unsolved in 10596 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:42] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/93 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 102/196 variables, 94/167 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 68/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 99/334 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:45] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:22:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/196 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/196 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 336 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9699 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 53/53 constraints]
After SMT, in 20315ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 20316ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20701 ms. Remains : 94/94 places, 102/102 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 44841 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((F(p0)||X(X(p1))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 170
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 52 place count 172 transition count 157
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 78 place count 159 transition count 157
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 124 place count 136 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 135 transition count 133
Applied a total of 126 rules in 15 ms. Remains 135 /198 variables (removed 63) and now considering 133/196 (removed 63) transitions.
// Phase 1: matrix 133 rows 135 cols
[2024-06-01 12:22:51] [INFO ] Computed 32 invariants in 6 ms
[2024-06-01 12:22:51] [INFO ] Implicit Places using invariants in 156 ms returned [8, 11, 36, 43, 53, 54, 66, 97, 98, 125]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 158 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/198 places, 133/196 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 125 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 122 transition count 130
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 0 with 44 rules applied. Total rules applied 50 place count 100 transition count 108
Applied a total of 50 rules in 7 ms. Remains 100 /125 variables (removed 25) and now considering 108/133 (removed 25) transitions.
// Phase 1: matrix 108 rows 100 cols
[2024-06-01 12:22:51] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:22:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 12:22:51] [INFO ] Invariant cache hit.
[2024-06-01 12:22:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:22:51] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/198 places, 108/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 516 ms. Remains : 100/198 places, 108/196 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-10
Product exploration explored 100000 steps with 3273 reset in 243 ms.
Product exploration explored 100000 steps with 3176 reset in 290 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) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 399 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
[2024-06-01 12:22:53] [INFO ] Invariant cache hit.
[2024-06-01 12:22:53] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 51/208 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 5/20 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms 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) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 512 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 100 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 : 100/100 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-06-01 12:22:53] [INFO ] Invariant cache hit.
[2024-06-01 12:22:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 12:22:54] [INFO ] Invariant cache hit.
[2024-06-01 12:22:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:22:54] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-06-01 12:22:54] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 12:22:54] [INFO ] Invariant cache hit.
[2024-06-01 12:22:54] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:22:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:22:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:22:56] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:22:56] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:22:56] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:22:56] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:22:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:22:59] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:23:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:23:01] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 108/208 variables, 100/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 67/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 237 constraints, problems are : Problem set: 0 solved, 105 unsolved in 11478 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:23:06] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 3/100 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 108/208 variables, 100/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 67/238 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 105/343 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 343 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6782 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 49/49 constraints]
After SMT, in 18285ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 18287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18660 ms. Remains : 100/100 places, 108/108 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3285 reset in 228 ms.
Product exploration explored 100000 steps with 3211 reset in 392 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 108/108 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 100 transition count 107
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 95 transition count 103
Applied a total of 10 rules in 7 ms. Remains 95 /100 variables (removed 5) and now considering 103/108 (removed 5) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-06-01 12:23:13] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:23:14] [INFO ] Implicit Places using invariants in 165 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/100 places, 103/108 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 99
Applied a total of 8 rules in 6 ms. Remains 90 /94 variables (removed 4) and now considering 99/103 (removed 4) transitions.
// Phase 1: matrix 99 rows 90 cols
[2024-06-01 12:23:14] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 12:23:14] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 12:23:14] [INFO ] Invariant cache hit.
[2024-06-01 12:23:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:23:14] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/100 places, 99/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 666 ms. Remains : 90/100 places, 99/108 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 23307 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((F(p1)||X(G(p2))))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-06-01 12:23:14] [INFO ] Computed 32 invariants in 2 ms
[2024-06-01 12:23:14] [INFO ] Implicit Places using invariants in 190 ms returned [16, 21, 35, 54, 66, 86, 99, 141, 144, 145, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 192 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 187/198 places, 196/196 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11
Product exploration explored 100000 steps with 801 reset in 137 ms.
Product exploration explored 100000 steps with 803 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4041 steps (0 resets) in 15 ms. (252 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 396 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 196 rows 187 cols
[2024-06-01 12:23:16] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:23:16] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-06-01 12:23:16] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:23:17] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2024-06-01 12:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:23:17] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-06-01 12:23:17] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 12:23:17] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-06-01 12:23:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:23:17] [INFO ] [Nat]Added 68 Read/Feed constraints in 75 ms returned sat
[2024-06-01 12:23:17] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 3 ms to minimize.
[2024-06-01 12:23:18] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:23:18] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:23:18] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 3 ms to minimize.
[2024-06-01 12:23:18] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-06-01 12:23:18] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 3 ms to minimize.
[2024-06-01 12:23:18] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:23:18] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-06-01 12:23:19] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:23:19] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:23:19] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:23:19] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 3 ms to minimize.
[2024-06-01 12:23:19] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2024-06-01 12:23:19] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 3 ms to minimize.
[2024-06-01 12:23:19] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-06-01 12:23:20] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:23:20] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2246 ms
[2024-06-01 12:23:20] [INFO ] Computed and/alt/rep : 191/335/191 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 12:23:21] [INFO ] Added : 128 causal constraints over 26 iterations in 1110 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-06-01 12:23:21] [INFO ] Invariant cache hit.
[2024-06-01 12:23:21] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 12:23:21] [INFO ] Invariant cache hit.
[2024-06-01 12:23:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:23:21] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-06-01 12:23:21] [INFO ] Invariant cache hit.
[2024-06-01 12:23:21] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:23] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:23:23] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:23:23] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:23:23] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:23:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:23:23] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:23:25] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:23:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:25] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:23:25] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:23:25] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:23:25] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:26] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:23:26] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:23:27] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:29] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:23:30] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 5/186 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 3 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 3 ms to minimize.
[2024-06-01 12:23:34] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-06-01 12:23:35] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:23:35] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-06-01 12:23:35] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:23:35] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:23:36] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:23:36] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:23:36] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:38] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 3 ms to minimize.
[2024-06-01 12:23:38] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:23:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:23:38] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:23:39] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:23:39] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:23:39] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 3 ms to minimize.
[2024-06-01 12:23:40] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:44] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 15 (OVERLAPS) 196/383 variables, 187/257 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 68/325 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 325 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 5/186 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:23:54] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 1/187 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 196/383 variables, 187/258 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 191/517 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:24:04] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:24:11] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 519 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 52/52 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in LTL mode , in 1 iterations and 60843 ms. Remains : 187/187 places, 196/196 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 p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8660 steps (1 resets) in 26 ms. (320 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 447 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:24:23] [INFO ] Invariant cache hit.
[2024-06-01 12:24:23] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-06-01 12:24:23] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:24:23] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-06-01 12:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:24:24] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-06-01 12:24:24] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 12:24:24] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2024-06-01 12:24:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:24:24] [INFO ] [Nat]Added 68 Read/Feed constraints in 89 ms returned sat
[2024-06-01 12:24:24] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 3 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:24:25] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 3 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 3 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:24:26] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 3 ms to minimize.
[2024-06-01 12:24:27] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2348 ms
[2024-06-01 12:24:27] [INFO ] Computed and/alt/rep : 191/335/191 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 12:24:28] [INFO ] Added : 166 causal constraints over 34 iterations in 1190 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 800 reset in 224 ms.
Product exploration explored 100000 steps with 803 reset in 259 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 187 transition count 196
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 35 place count 187 transition count 198
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 48 place count 187 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 177 transition count 187
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 177 transition count 187
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 107 place count 177 transition count 187
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 132 place count 152 transition count 162
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 157 place count 152 transition count 162
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 157 rules in 33 ms. Remains 152 /187 variables (removed 35) and now considering 162/196 (removed 34) transitions.
[2024-06-01 12:24:29] [INFO ] Redundant transitions in 9 ms returned []
Running 159 sub problems to find dead transitions.
// Phase 1: matrix 162 rows 152 cols
[2024-06-01 12:24:29] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:24:29] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 12:24:30] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-01 12:24:30] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:24:30] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-01 12:24:30] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-06-01 12:24:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 16/33 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-06-01 12:24:32] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/34 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-06-01 12:24:34] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:24:34] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:24:34] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 3/37 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-06-01 12:24:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/38 constraints. Problems are: Problem set: 38 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 38 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 3/151 variables, 3/41 constraints. Problems are: Problem set: 38 solved, 121 unsolved
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 12:24:37] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-06-01 12:24:38] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 14/55 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-06-01 12:24:39] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/56 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-06-01 12:24:40] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:24:40] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 3 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:24:41] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 6/62 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-06-01 12:24:42] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 1/63 constraints. Problems are: Problem set: 48 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/63 constraints. Problems are: Problem set: 48 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 1/152 variables, 1/64 constraints. Problems are: Problem set: 48 solved, 111 unsolved
[2024-06-01 12:24:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:24:44] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:24:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:24:44] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 12:24:44] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD100 is UNSAT
[2024-06-01 12:24:45] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 6/70 constraints. Problems are: Problem set: 53 solved, 106 unsolved
[2024-06-01 12:24:45] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 1/71 constraints. Problems are: Problem set: 53 solved, 106 unsolved
[2024-06-01 12:24:47] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/72 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/72 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 18 (OVERLAPS) 162/314 variables, 152/224 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 68/292 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/314 variables, 0/292 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 21 (OVERLAPS) 0/314 variables, 0/292 constraints. Problems are: Problem set: 53 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 292 constraints, problems are : Problem set: 53 solved, 106 unsolved in 26000 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 53 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 10/10 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/11 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 38/49 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/49 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 50/146 variables, 8/57 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 8/65 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/65 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 6/152 variables, 2/67 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 5/72 constraints. Problems are: Problem set: 53 solved, 106 unsolved
[2024-06-01 12:24:57] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/73 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/73 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 162/314 variables, 152/225 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 68/293 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 106/399 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/399 constraints. Problems are: Problem set: 53 solved, 106 unsolved
At refinement iteration 15 (OVERLAPS) 0/314 variables, 0/399 constraints. Problems are: Problem set: 53 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 399 constraints, problems are : Problem set: 53 solved, 106 unsolved in 12207 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 106/159 constraints, Known Traps: 52/52 constraints]
After SMT, in 38266ms problems are : Problem set: 53 solved, 106 unsolved
Search for dead transitions found 53 dead transitions in 38269ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/187 places, 109/196 transitions.
Graph (complete) has 336 edges and 152 vertex of which 100 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.4 ms
Discarding 52 places :
Also discarding 0 output transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 100 transition count 109
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 100 transition count 109
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 10 ms. Remains 100 /152 variables (removed 52) and now considering 109/109 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/187 places, 109/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38331 ms. Remains : 100/187 places, 109/196 transitions.
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 187 cols
[2024-06-01 12:25:07] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:25:07] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 12:25:07] [INFO ] Invariant cache hit.
[2024-06-01 12:25:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:25:08] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-06-01 12:25:08] [INFO ] Invariant cache hit.
[2024-06-01 12:25:08] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:25:09] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:25:10] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:25:11] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:25:11] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:25:11] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:25:11] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:12] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:25:12] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:25:12] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:15] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:25:15] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:17] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 5/186 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 4 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 4 ms to minimize.
[2024-06-01 12:25:24] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:26] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 3 ms to minimize.
[2024-06-01 12:25:26] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:25:26] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:25:26] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:25:26] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:25:26] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:25:27] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:25:27] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 15 (OVERLAPS) 196/383 variables, 187/257 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 68/325 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 325 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 5/186 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:41] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 1/187 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 196/383 variables, 187/258 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 191/517 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:50] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 12:25:57] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 519 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 52/52 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in LTL mode , in 1 iterations and 60604 ms. Remains : 187/187 places, 196/196 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 173587 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)||G(p2)))&&p0)))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-06-01 12:26:08] [INFO ] Computed 32 invariants in 2 ms
[2024-06-01 12:26:08] [INFO ] Implicit Places using invariants in 302 ms returned [16, 21, 35, 54, 66, 85, 99, 141, 144, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 304 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 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 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-06-01 12:26:08] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 12:26:08] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-01 12:26:08] [INFO ] Invariant cache hit.
[2024-06-01 12:26:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:26:09] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1058 ms. Remains : 186/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 1278 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(G(p1))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-06-01 12:26:09] [INFO ] Computed 32 invariants in 3 ms
[2024-06-01 12:26:09] [INFO ] Implicit Places using invariants in 269 ms returned [21, 35, 54, 66, 86, 99, 141, 144, 145, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 281 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 188/198 places, 196/196 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-14
Entered a terminal (fully accepting) state of product in 7983 steps with 0 reset in 17 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 170
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 170
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 172 transition count 156
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 158 transition count 156
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 132 place count 132 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 131 transition count 129
Applied a total of 134 rules in 19 ms. Remains 131 /198 variables (removed 67) and now considering 129/196 (removed 67) transitions.
// Phase 1: matrix 129 rows 131 cols
[2024-06-01 12:26:10] [INFO ] Computed 32 invariants in 2 ms
[2024-06-01 12:26:10] [INFO ] Implicit Places using invariants in 280 ms returned [8, 11, 21, 33, 40, 50, 64, 93, 96, 97, 121]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 282 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 129/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 115 transition count 124
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 115 transition count 124
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 36 place count 102 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 101 transition count 110
Applied a total of 38 rules in 16 ms. Remains 101 /120 variables (removed 19) and now considering 110/129 (removed 19) transitions.
// Phase 1: matrix 110 rows 101 cols
[2024-06-01 12:26:10] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:26:10] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:26:10] [INFO ] Invariant cache hit.
[2024-06-01 12:26:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:26:10] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/198 places, 110/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 867 ms. Remains : 101/198 places, 110/196 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 244 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-15 finished in 1179 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(F(p0)))))'
Found a Shortening insensitive property : ParamProductionCell-PT-5-LTLFireability-07
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 170
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 170
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 172 transition count 156
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 158 transition count 156
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 138 place count 129 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 128 transition count 126
Applied a total of 140 rules in 21 ms. Remains 128 /198 variables (removed 70) and now considering 126/196 (removed 70) transitions.
// Phase 1: matrix 126 rows 128 cols
[2024-06-01 12:26:11] [INFO ] Computed 32 invariants in 9 ms
[2024-06-01 12:26:12] [INFO ] Implicit Places using invariants in 297 ms returned [8, 11, 21, 33, 40, 50, 51, 63, 90, 93, 118]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 298 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/198 places, 126/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 116 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 116 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 115 transition count 124
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 56 place count 89 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 88 transition count 97
Applied a total of 58 rules in 8 ms. Remains 88 /117 variables (removed 29) and now considering 97/126 (removed 29) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-06-01 12:26:12] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:26:12] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 12:26:12] [INFO ] Invariant cache hit.
[2024-06-01 12:26:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:26:12] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 88/198 places, 97/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 834 ms. Remains : 88/198 places, 97/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07
Product exploration explored 100000 steps with 3113 reset in 218 ms.
Product exploration explored 100000 steps with 3103 reset in 258 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 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 118 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 12:26:13] [INFO ] Invariant cache hit.
[2024-06-01 12:26:13] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:26:13] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:26:14] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-01 12:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:26:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:26:14] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:26:14] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-01 12:26:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:26:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:26:14] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:26:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1065 ms
[2024-06-01 12:26:15] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:26:15] [INFO ] Added : 81 causal constraints over 17 iterations in 324 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 12:26:15] [INFO ] Invariant cache hit.
[2024-06-01 12:26:15] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:26:15] [INFO ] Invariant cache hit.
[2024-06-01 12:26:16] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:26:16] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-06-01 12:26:16] [INFO ] Invariant cache hit.
[2024-06-01 12:26:16] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:16] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:26:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:26:17] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:26:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:26:19] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:26:19] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:26:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:26:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:20] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:26:21] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:26:21] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:22] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 217 constraints, problems are : Problem set: 0 solved, 94 unsolved in 9603 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/185 variables, 88/152 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 66/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 94/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/185 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 312 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6557 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 43/43 constraints]
After SMT, in 16190ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 16200ms
Finished structural reductions in LTL mode , in 1 iterations and 16707 ms. Remains : 88/88 places, 97/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 131 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 12:26:33] [INFO ] Invariant cache hit.
[2024-06-01 12:26:33] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-06-01 12:26:33] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:26:33] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-06-01 12:26:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:26:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:26:33] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:26:33] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 12:26:33] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:26:33] [INFO ] [Nat]Added 66 Read/Feed constraints in 21 ms returned sat
[2024-06-01 12:26:33] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:26:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1079 ms
[2024-06-01 12:26:34] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 12:26:35] [INFO ] Added : 81 causal constraints over 17 iterations in 318 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3089 reset in 224 ms.
Product exploration explored 100000 steps with 3108 reset in 260 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 12:26:36] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-01 12:26:36] [INFO ] Invariant cache hit.
[2024-06-01 12:26:36] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:26:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:26:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:26:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:26:39] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:26:39] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:39] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:39] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:26:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:40] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:26:41] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:26:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 217 constraints, problems are : Problem set: 0 solved, 94 unsolved in 10505 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/185 variables, 88/152 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 66/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 94/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/185 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 312 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6137 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 43/43 constraints]
After SMT, in 16667ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 16669ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16680 ms. Remains : 88/88 places, 97/97 transitions.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 12:26:52] [INFO ] Invariant cache hit.
[2024-06-01 12:26:53] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 12:26:53] [INFO ] Invariant cache hit.
[2024-06-01 12:26:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:26:53] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-06-01 12:26:53] [INFO ] Invariant cache hit.
[2024-06-01 12:26:53] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:26:54] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:26:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:26:56] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:26:56] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:26:56] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:26:56] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:26:56] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:57] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:26:57] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:26:58] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:26:59] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:26:59] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 66/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 217 constraints, problems are : Problem set: 0 solved, 94 unsolved in 10067 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:27:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 97/185 variables, 88/152 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 66/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 94/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/185 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 312 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4887 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 43/43 constraints]
After SMT, in 14980ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 14982ms
Finished structural reductions in LTL mode , in 1 iterations and 15476 ms. Remains : 88/88 places, 97/97 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 57175 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)||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(X(p1))))))'
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((F(p1)||X(G(p2))))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-5-LTLFireability-11
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 50 place count 173 transition count 157
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 159 transition count 157
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 134 place count 131 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 130 transition count 128
Applied a total of 136 rules in 13 ms. Remains 130 /198 variables (removed 68) and now considering 128/196 (removed 68) transitions.
// Phase 1: matrix 128 rows 130 cols
[2024-06-01 12:27:09] [INFO ] Computed 32 invariants in 1 ms
[2024-06-01 12:27:09] [INFO ] Implicit Places using invariants in 279 ms returned [8, 11, 21, 33, 40, 52, 64, 91, 94, 95, 119]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 280 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 119/198 places, 128/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 117 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 117 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 116 transition count 125
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 2 with 42 rules applied. Total rules applied 48 place count 95 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 94 transition count 103
Applied a total of 50 rules in 8 ms. Remains 94 /119 variables (removed 25) and now considering 103/128 (removed 25) transitions.
// Phase 1: matrix 103 rows 94 cols
[2024-06-01 12:27:09] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 12:27:09] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 12:27:09] [INFO ] Invariant cache hit.
[2024-06-01 12:27:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:27:09] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 94/198 places, 103/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 799 ms. Remains : 94/198 places, 103/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11
Product exploration explored 100000 steps with 1577 reset in 246 ms.
Product exploration explored 100000 steps with 1584 reset in 282 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1502 steps (0 resets) in 13 ms. (107 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 412 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:27:11] [INFO ] Invariant cache hit.
[2024-06-01 12:27:11] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-06-01 12:27:11] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:27:11] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-01 12:27:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:27:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 12:27:11] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:27:11] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 12:27:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:27:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2024-06-01 12:27:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:27:11] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:27:11] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:27:11] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:27:12] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:27:13] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:27:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:27:13] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:27:13] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:27:13] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:27:13] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:27:13] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1701 ms
[2024-06-01 12:27:13] [INFO ] Computed and/alt/rep : 100/245/100 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:27:13] [INFO ] Added : 91 causal constraints over 19 iterations in 363 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 12:27:13] [INFO ] Invariant cache hit.
[2024-06-01 12:27:13] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 12:27:13] [INFO ] Invariant cache hit.
[2024-06-01 12:27:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:27:14] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 12:27:14] [INFO ] Invariant cache hit.
[2024-06-01 12:27:14] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:14] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:27:16] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:27:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:18] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:27:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:18] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:27:18] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:27:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:27:19] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:27:19] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:27:19] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:20] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:27:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:27:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:27:20] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 1/94 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 103/197 variables, 94/166 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 66/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 232 constraints, problems are : Problem set: 0 solved, 100 unsolved in 12186 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:27] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:28] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 103/197 variables, 94/168 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 66/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 100/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 334 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6063 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 53/53 constraints]
After SMT, in 18276ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 18278ms
Finished structural reductions in LTL mode , in 1 iterations and 18808 ms. Remains : 94/94 places, 103/103 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 p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3368 steps (0 resets) in 17 ms. (187 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 442 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
[2024-06-01 12:27:33] [INFO ] Invariant cache hit.
[2024-06-01 12:27:33] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 12:27:33] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:27:33] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-01 12:27:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:27:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-06-01 12:27:34] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:27:34] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-01 12:27:34] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:27:34] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:27:35] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1705 ms
[2024-06-01 12:27:35] [INFO ] Computed and/alt/rep : 100/245/100 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 12:27:36] [INFO ] Added : 91 causal constraints over 19 iterations in 368 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1589 reset in 243 ms.
Product exploration explored 100000 steps with 1588 reset in 303 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 12:27:37] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-01 12:27:37] [INFO ] Invariant cache hit.
[2024-06-01 12:27:37] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:37] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:27:37] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:27:37] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:27:38] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:27:40] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:27:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:40] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:43] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:27:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:27:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:27:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 1/94 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 103/197 variables, 94/166 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 66/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 232 constraints, problems are : Problem set: 0 solved, 100 unsolved in 12286 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:50] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:51] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 103/197 variables, 94/168 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 66/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 100/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 334 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7407 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 53/53 constraints]
After SMT, in 19721ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 19723ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19735 ms. Remains : 94/94 places, 103/103 transitions.
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 12:27:57] [INFO ] Invariant cache hit.
[2024-06-01 12:27:57] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 12:27:57] [INFO ] Invariant cache hit.
[2024-06-01 12:27:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:27:57] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 12:27:57] [INFO ] Invariant cache hit.
[2024-06-01 12:27:57] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:27:58] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:27:59] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:28:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:28:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:28:01] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:28:02] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:28:02] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:28:02] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:28:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:28:02] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:28:03] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:28:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:28:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:28:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 1/94 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 103/197 variables, 94/166 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 66/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 232 constraints, problems are : Problem set: 0 solved, 100 unsolved in 12486 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:28:10] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 12:28:12] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 103/197 variables, 94/168 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 66/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 100/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 334 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7672 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 53/53 constraints]
After SMT, in 20186ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 20189ms
Finished structural reductions in LTL mode , in 1 iterations and 20684 ms. Remains : 94/94 places, 103/103 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 69013 ms.
[2024-06-01 12:28:17] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:28:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 12:28:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 196 transitions and 672 arcs took 12 ms.
Total runtime 542294 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ParamProductionCell-PT-5-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717244971529

--------------------
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
mcc2024
ltl formula name ParamProductionCell-PT-5-LTLFireability-07
ltl formula formula --ltl=/tmp/4737/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 196 transitions and 672 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4737/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 200 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 203 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~103 levels ~10000 states ~27272 transitions
pnml2lts-mc( 1/ 4): ~61 levels ~20000 states ~60276 transitions
pnml2lts-mc( 2/ 4): ~103 levels ~40000 states ~123428 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 62432
pnml2lts-mc( 0/ 4): unique states count: 62432
pnml2lts-mc( 0/ 4): unique transitions count: 232200
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 171971
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 63648
pnml2lts-mc( 0/ 4): - cum. max stack depth: 368
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 63648 states 238088 transitions, fanout: 3.741
pnml2lts-mc( 0/ 4): Total exploration time 0.800 sec (0.790 sec minimum, 0.798 sec on average)
pnml2lts-mc( 0/ 4): States per second: 79560, Transitions per second: 297610
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 12.2 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 196 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-5-LTLFireability-09
ltl formula formula --ltl=/tmp/4737/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 196 transitions and 672 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4737/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4737/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4737/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4737/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 200 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 297 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1422 levels ~10000 states ~25268 transitions
pnml2lts-mc( 2/ 4): ~1866 levels ~20000 states ~44388 transitions
pnml2lts-mc( 1/ 4): ~2342 levels ~40000 states ~83824 transitions
pnml2lts-mc( 2/ 4): ~1866 levels ~80000 states ~160080 transitions
pnml2lts-mc( 2/ 4): ~1866 levels ~160000 states ~345680 transitions
pnml2lts-mc( 2/ 4): ~9717 levels ~320000 states ~818528 transitions
pnml2lts-mc( 2/ 4): ~28731 levels ~640000 states ~2100724 transitions
pnml2lts-mc( 2/ 4): ~54299 levels ~1280000 states ~4862504 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 131312
pnml2lts-mc( 0/ 4): unique states count: 1769470
pnml2lts-mc( 0/ 4): unique transitions count: 6962244
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 161731
pnml2lts-mc( 0/ 4): - claim found count: 5045768
pnml2lts-mc( 0/ 4): - claim success count: 1776181
pnml2lts-mc( 0/ 4): - cum. max stack depth: 379428
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1778408 states 6996097 transitions, fanout: 3.934
pnml2lts-mc( 0/ 4): Total exploration time 11.960 sec (11.960 sec minimum, 11.960 sec on average)
pnml2lts-mc( 0/ 4): States per second: 148696, Transitions per second: 584958
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 15.5MB, 9.2 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 196 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 15.5MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-5-LTLFireability-10
ltl formula formula --ltl=/tmp/4737/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 196 transitions and 672 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4737/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4737/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4737/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4737/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 199 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 253 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~364 levels ~10000 states ~16196 transitions
pnml2lts-mc( 3/ 4): ~369 levels ~20000 states ~33868 transitions
pnml2lts-mc( 3/ 4): ~840 levels ~40000 states ~80488 transitions
pnml2lts-mc( 2/ 4): ~538 levels ~80000 states ~181156 transitions
pnml2lts-mc( 2/ 4): ~5516 levels ~160000 states ~376416 transitions
pnml2lts-mc( 2/ 4): ~19621 levels ~320000 states ~921020 transitions
pnml2lts-mc( 2/ 4): ~44167 levels ~640000 states ~2180472 transitions
pnml2lts-mc( 3/ 4): ~102140 levels ~1280000 states ~4867868 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 188897
pnml2lts-mc( 0/ 4): unique states count: 1827055
pnml2lts-mc( 0/ 4): unique transitions count: 7494150
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 637670
pnml2lts-mc( 0/ 4): - claim found count: 5060329
pnml2lts-mc( 0/ 4): - claim success count: 1831951
pnml2lts-mc( 0/ 4): - cum. max stack depth: 346225
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1840007 states 7550583 transitions, fanout: 4.104
pnml2lts-mc( 0/ 4): Total exploration time 11.460 sec (11.460 sec minimum, 11.460 sec on average)
pnml2lts-mc( 0/ 4): States per second: 160559, Transitions per second: 658864
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 16.0MB, 9.2 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 196 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 16.0MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-5-LTLFireability-11
ltl formula formula --ltl=/tmp/4737/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 196 transitions and 672 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4737/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4737/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4737/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4737/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 200 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 298 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~255 levels ~10000 states ~98412 transitions
pnml2lts-mc( 1/ 4): ~255 levels ~20000 states ~237804 transitions
pnml2lts-mc( 1/ 4): ~255 levels ~40000 states ~582132 transitions
pnml2lts-mc( 1/ 4): ~255 levels ~80000 states ~1335660 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~160000 states ~2415848 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~320000 states ~4947240 transitions
pnml2lts-mc( 3/ 4): ~235 levels ~640000 states ~10803924 transitions
pnml2lts-mc( 3/ 4): ~238 levels ~1280000 states ~25882920 transitions
pnml2lts-mc( 3/ 4): ~28608 levels ~2560000 states ~54521048 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3282433
pnml2lts-mc( 0/ 4): unique states count: 4896039
pnml2lts-mc( 0/ 4): unique transitions count: 123096927
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 102821974
pnml2lts-mc( 0/ 4): - claim found count: 16904147
pnml2lts-mc( 0/ 4): - claim success count: 5014476
pnml2lts-mc( 0/ 4): - cum. max stack depth: 121330
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5015029 states 125894653 transitions, fanout: 25.103
pnml2lts-mc( 0/ 4): Total exploration time 47.650 sec (47.650 sec minimum, 47.650 sec on average)
pnml2lts-mc( 0/ 4): States per second: 105247, Transitions per second: 2642070
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 42.3MB, 9.1 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 196 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 42.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ParamProductionCell-PT-5, 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 r512-smll-171654406800052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-5.tgz
mv ParamProductionCell-PT-5 execution
cd execution
if [ "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 ;