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.r476-tall-171620505400212.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 CSRepetitions-COL-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505400212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K Apr 12 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717201219146

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:20:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:20:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:20:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 00:20:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 00:20:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 571 ms
[2024-06-01 00:20:21] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 00:20:21] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 5 ms.
[2024-06-01 00:20:21] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-COL-07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Reduction of identical properties reduced properties to check from 9 to 6
RANDOM walk for 599 steps (5 resets) in 14 ms. (39 steps per ms) remains 0/6 properties
[2024-06-01 00:20:21] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:20:21] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 7
[2024-06-01 00:20:21] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 19 ms.
[2024-06-01 00:20:21] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 198 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-06-01 00:20:21] [INFO ] Computed 50 invariants in 18 ms
[2024-06-01 00:20:21] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 00:20:21] [INFO ] Invariant cache hit.
[2024-06-01 00:20:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:20:21] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:20:21] [INFO ] Invariant cache hit.
[2024-06-01 00:20:21] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8517 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7916 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 16721ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 16739ms
Finished structural reductions in LTL mode , in 1 iterations and 17141 ms. Remains : 198/198 places, 245/245 transitions.
Support contains 198 out of 198 places after structural reductions.
[2024-06-01 00:20:38] [INFO ] Flatten gal took : 26 ms
[2024-06-01 00:20:38] [INFO ] Flatten gal took : 34 ms
[2024-06-01 00:20:38] [INFO ] Input system was already deterministic with 245 transitions.
Reduction of identical properties reduced properties to check from 11 to 7
RANDOM walk for 362 steps (0 resets) in 34 ms. (10 steps per ms) remains 0/7 properties
Computed a total of 0 stabilizing places and 49 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' '!((F(G(p0))||G(p1)))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Applied a total of 243 rules in 32 ms. Remains 52 /198 variables (removed 146) and now considering 148/245 (removed 97) transitions.
// Phase 1: matrix 148 rows 52 cols
[2024-06-01 00:20:39] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 00:20:39] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 00:20:39] [INFO ] Invariant cache hit.
[2024-06-01 00:20:39] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-01 00:20:39] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 00:20:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 53 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 99/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 152 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3092ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/198 places, 148/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3205 ms. Remains : 52/198 places, 148/245 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-00
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-00 finished in 3491 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 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-06-01 00:20:42] [INFO ] Computed 50 invariants in 2 ms
[2024-06-01 00:20:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 00:20:42] [INFO ] Invariant cache hit.
[2024-06-01 00:20:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:20:42] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:20:42] [INFO ] Invariant cache hit.
[2024-06-01 00:20:42] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7949 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6873 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15002ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15005ms
Finished structural reductions in LTL mode , in 1 iterations and 15161 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-07
Stuttering criterion allowed to conclude after 8748 steps with 307 reset in 88 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-07 finished in 15438 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(((p1 U p2)||p0)))'
Support contains 50 out of 198 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 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 16 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:20:58] [INFO ] Invariant cache hit.
[2024-06-01 00:20:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 00:20:58] [INFO ] Invariant cache hit.
[2024-06-01 00:20:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:20:58] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-06-01 00:20:58] [INFO ] Redundant transitions in 9 ms returned []
Running 196 sub problems to find dead transitions.
[2024-06-01 00:20:58] [INFO ] Invariant cache hit.
[2024-06-01 00:20:58] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7929 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7238 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15339ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15581 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-08
Product exploration explored 100000 steps with 9570 reset in 640 ms.
Product exploration explored 100000 steps with 9493 reset in 674 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 45 steps (0 resets) in 10 ms. (4 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p2))]
[2024-06-01 00:21:15] [INFO ] Invariant cache hit.
[2024-06-01 00:21:16] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2024-06-01 00:21:16] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 00:21:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-06-01 00:21:16] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-01 00:21:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:21:16] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:21:16] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 00:21:16] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 50 out of 198 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 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:21:16] [INFO ] Invariant cache hit.
[2024-06-01 00:21:16] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 00:21:16] [INFO ] Invariant cache hit.
[2024-06-01 00:21:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:21:16] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-01 00:21:16] [INFO ] Redundant transitions in 3 ms returned []
Running 196 sub problems to find dead transitions.
[2024-06-01 00:21:16] [INFO ] Invariant cache hit.
[2024-06-01 00:21:16] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7878 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7595 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15647ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15649ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15871 ms. Remains : 198/198 places, 245/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 38 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 352 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
[2024-06-01 00:21:33] [INFO ] Invariant cache hit.
[2024-06-01 00:21:33] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-06-01 00:21:33] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:21:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-06-01 00:21:33] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-01 00:21:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:21:33] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:21:33] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 00:21:33] [INFO ] Added : 0 causal constraints over 0 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9632 reset in 616 ms.
Product exploration explored 100000 steps with 9602 reset in 627 ms.
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Applied a total of 243 rules in 16 ms. Remains 52 /198 variables (removed 146) and now considering 148/245 (removed 97) transitions.
// Phase 1: matrix 148 rows 52 cols
[2024-06-01 00:21:35] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 00:21:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 00:21:35] [INFO ] Invariant cache hit.
[2024-06-01 00:21:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 00:21:35] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 00:21:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 53 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 99/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 152 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3018ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/198 places, 148/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3100 ms. Remains : 52/198 places, 148/245 transitions.
Treatment of property CSRepetitions-COL-07-LTLFireability-08 finished in 40262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(!p1)))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-06-01 00:21:38] [INFO ] Computed 50 invariants in 1 ms
[2024-06-01 00:21:38] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 00:21:38] [INFO ] Invariant cache hit.
[2024-06-01 00:21:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:21:38] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:21:38] [INFO ] Invariant cache hit.
[2024-06-01 00:21:38] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8124 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7486 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15788ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15791ms
Finished structural reductions in LTL mode , in 1 iterations and 16107 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 158 ms :[p1, true, p1, p1]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 672 ms.
Product exploration explored 100000 steps with 50000 reset in 670 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-09 finished in 17654 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((F((G(!p1)||G(p2)))&&p0)))'
Support contains 100 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:21:56] [INFO ] Invariant cache hit.
[2024-06-01 00:21:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 00:21:56] [INFO ] Invariant cache hit.
[2024-06-01 00:21:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:21:56] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-01 00:21:56] [INFO ] Redundant transitions in 2 ms returned []
Running 196 sub problems to find dead transitions.
[2024-06-01 00:21:56] [INFO ] Invariant cache hit.
[2024-06-01 00:21:56] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7838 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7393 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15393ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15634 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-10
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-10 finished in 15800 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((X(!p0) U ((!p1&&X(!p0))||G(X(!p0)))))||!p1))))'
Support contains 148 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:22:11] [INFO ] Invariant cache hit.
[2024-06-01 00:22:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 00:22:11] [INFO ] Invariant cache hit.
[2024-06-01 00:22:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:22:11] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:22:11] [INFO ] Invariant cache hit.
[2024-06-01 00:22:11] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7821 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7563 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15541ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15544ms
Finished structural reductions in LTL mode , in 1 iterations and 15696 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-11
Product exploration explored 100000 steps with 1209 reset in 1048 ms.
Stack based approach found an accepted trace after 9544 steps with 116 reset with depth 81 and stack size 81 in 107 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-11 finished in 17028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(X(p2)&&p1))))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:22:28] [INFO ] Invariant cache hit.
[2024-06-01 00:22:28] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 00:22:28] [INFO ] Invariant cache hit.
[2024-06-01 00:22:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:22:29] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:22:29] [INFO ] Invariant cache hit.
[2024-06-01 00:22:29] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7922 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7258 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15331ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15332ms
Finished structural reductions in LTL mode , in 1 iterations and 15578 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-12
Product exploration explored 100000 steps with 1088 reset in 899 ms.
Product exploration explored 100000 steps with 1098 reset in 899 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 18 factoid took 481 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40002 steps (486 resets) in 612 ms. (65 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 790 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 2/2 properties
[2024-06-01 00:22:47] [INFO ] Invariant cache hit.
[2024-06-01 00:22:47] [INFO ] State equation strengthened by 49 read => feed constraints.
Problem apf2 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 99/443 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/198 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 891 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
[2024-06-01 00:22:48] [INFO ] Invariant cache hit.
[2024-06-01 00:22:49] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:22:49] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-01 00:22:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:22:49] [INFO ] [Real]Added 49 Read/Feed constraints in 11 ms returned sat
[2024-06-01 00:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:22:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:22:49] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-01 00:22:49] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:22:49] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 00:22:49] [INFO ] Added : 4 causal constraints over 1 iterations in 53 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
[2024-06-01 00:22:49] [INFO ] Invariant cache hit.
[2024-06-01 00:22:50] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:22:50] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-01 00:22:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:22:50] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:22:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 00:22:51] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-01 00:22:51] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:22:51] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 00:22:51] [INFO ] Added : 4 causal constraints over 1 iterations in 69 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:22:51] [INFO ] Invariant cache hit.
[2024-06-01 00:22:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 00:22:51] [INFO ] Invariant cache hit.
[2024-06-01 00:22:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:22:51] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:22:51] [INFO ] Invariant cache hit.
[2024-06-01 00:22:51] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8133 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7846 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 16147ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 16149ms
Finished structural reductions in LTL mode , in 1 iterations and 16413 ms. Remains : 198/198 places, 245/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 14 factoid took 492 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 6
RANDOM walk for 11225 steps (133 resets) in 62 ms. (178 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 770 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 91 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
[2024-06-01 00:23:09] [INFO ] Invariant cache hit.
[2024-06-01 00:23:09] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:23:09] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-01 00:23:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:23:10] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-06-01 00:23:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:23:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-06-01 00:23:10] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-01 00:23:10] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:23:10] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 00:23:10] [INFO ] Added : 4 causal constraints over 1 iterations in 46 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
[2024-06-01 00:23:10] [INFO ] Invariant cache hit.
[2024-06-01 00:23:11] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:23:11] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-01 00:23:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:23:11] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:23:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:23:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 00:23:11] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-01 00:23:11] [INFO ] [Nat]Added 49 Read/Feed constraints in 9 ms returned sat
[2024-06-01 00:23:11] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 00:23:11] [INFO ] Added : 4 causal constraints over 1 iterations in 52 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Stuttering acceptance computed with spot in 83 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1099 reset in 879 ms.
Product exploration explored 100000 steps with 1089 reset in 889 ms.
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:23:13] [INFO ] Invariant cache hit.
[2024-06-01 00:23:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 00:23:14] [INFO ] Invariant cache hit.
[2024-06-01 00:23:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:23:14] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:23:14] [INFO ] Invariant cache hit.
[2024-06-01 00:23:14] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7892 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7065 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15113ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15115ms
Finished structural reductions in LTL mode , in 1 iterations and 15359 ms. Remains : 198/198 places, 245/245 transitions.
Treatment of property CSRepetitions-COL-07-LTLFireability-12 finished in 60501 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(G(p0))||F(p1))))'
Support contains 148 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:23:29] [INFO ] Invariant cache hit.
[2024-06-01 00:23:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 00:23:29] [INFO ] Invariant cache hit.
[2024-06-01 00:23:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:23:29] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:23:29] [INFO ] Invariant cache hit.
[2024-06-01 00:23:29] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8081 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7714 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15967ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15969ms
Finished structural reductions in LTL mode , in 1 iterations and 16120 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 431 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-13 finished in 17213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 246 place count 50 transition count 147
Applied a total of 246 rules in 25 ms. Remains 50 /198 variables (removed 148) and now considering 147/245 (removed 98) transitions.
// Phase 1: matrix 147 rows 50 cols
[2024-06-01 00:23:46] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 00:23:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 00:23:46] [INFO ] Invariant cache hit.
[2024-06-01 00:23:46] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-06-01 00:23:46] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 00:23:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 147/196 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 50 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1074 ms.
Refiners :[State Equation: 50/50 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 147/196 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 98/148 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 148 constraints, problems are : Problem set: 0 solved, 98 unsolved in 841 ms.
Refiners :[State Equation: 50/50 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 1923ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 1924ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/198 places, 147/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2070 ms. Remains : 50/198 places, 147/245 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-14
Stuttering criterion allowed to conclude after 78 steps with 5 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-14 finished in 2161 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((F(G(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 147 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-06-01 00:23:48] [INFO ] Computed 50 invariants in 6 ms
[2024-06-01 00:23:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 00:23:48] [INFO ] Invariant cache hit.
[2024-06-01 00:23:48] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:23:48] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 00:23:48] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2024-06-01 00:23:48] [INFO ] Invariant cache hit.
[2024-06-01 00:23:48] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8167 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7524 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15876ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15879ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16056 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-15
Product exploration explored 100000 steps with 1102 reset in 691 ms.
Stack based approach found an accepted trace after 33474 steps with 366 reset with depth 95 and stack size 95 in 228 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-15 finished in 17146 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(((p1 U p2)||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(!p0)||(X(p2)&&p1))))'
Found a Shortening insensitive property : CSRepetitions-COL-07-LTLFireability-12
Stuttering acceptance computed with spot in 98 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:24:06] [INFO ] Invariant cache hit.
[2024-06-01 00:24:06] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 00:24:06] [INFO ] Invariant cache hit.
[2024-06-01 00:24:06] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:24:06] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:24:06] [INFO ] Invariant cache hit.
[2024-06-01 00:24:06] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7770 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7414 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15350ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15352ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 15614 ms. Remains : 198/198 places, 245/245 transitions.
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-12
Product exploration explored 100000 steps with 1097 reset in 868 ms.
Product exploration explored 100000 steps with 1089 reset in 912 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 18 factoid took 486 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40002 steps (479 resets) in 309 ms. (129 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 378 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
[2024-06-01 00:24:24] [INFO ] Invariant cache hit.
[2024-06-01 00:24:24] [INFO ] State equation strengthened by 49 read => feed constraints.
Problem apf2 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 99/443 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/198 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 850 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
[2024-06-01 00:24:25] [INFO ] Invariant cache hit.
[2024-06-01 00:24:26] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 00:24:26] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 00:24:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:24:26] [INFO ] [Real]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-06-01 00:24:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 00:24:26] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-06-01 00:24:26] [INFO ] [Nat]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-06-01 00:24:26] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 00:24:26] [INFO ] Added : 4 causal constraints over 1 iterations in 48 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
[2024-06-01 00:24:27] [INFO ] Invariant cache hit.
[2024-06-01 00:24:27] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 00:24:27] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-01 00:24:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:24:27] [INFO ] [Real]Added 49 Read/Feed constraints in 5 ms returned sat
[2024-06-01 00:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:24:28] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-01 00:24:28] [INFO ] [Nat]Added 49 Read/Feed constraints in 9 ms returned sat
[2024-06-01 00:24:28] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 00:24:28] [INFO ] Added : 4 causal constraints over 1 iterations in 51 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 00:24:28] [INFO ] Invariant cache hit.
[2024-06-01 00:24:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 00:24:28] [INFO ] Invariant cache hit.
[2024-06-01 00:24:28] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:24:28] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-01 00:24:28] [INFO ] Invariant cache hit.
[2024-06-01 00:24:28] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7794 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7536 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 15493ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15496ms
Finished structural reductions in LTL mode , in 1 iterations and 15751 ms. Remains : 198/198 places, 245/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 14 factoid took 388 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 6
RANDOM walk for 20845 steps (251 resets) in 66 ms. (311 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 699 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
[2024-06-01 00:24:45] [INFO ] Invariant cache hit.
[2024-06-01 00:24:45] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 00:24:45] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-01 00:24:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:24:45] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:24:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:24:46] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-01 00:24:46] [INFO ] [Nat]Added 49 Read/Feed constraints in 9 ms returned sat
[2024-06-01 00:24:46] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 00:24:46] [INFO ] Added : 4 causal constraints over 1 iterations in 46 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
[2024-06-01 00:24:46] [INFO ] Invariant cache hit.
[2024-06-01 00:24:47] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:24:47] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-01 00:24:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:24:47] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-06-01 00:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-06-01 00:24:47] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-01 00:24:47] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-06-01 00:24:47] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 00:24:47] [INFO ] Added : 4 causal constraints over 1 iterations in 49 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Stuttering acceptance computed with spot in 77 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1089 reset in 889 ms.
Stack based approach found an accepted trace after 96491 steps with 1052 reset with depth 66 and stack size 66 in 872 ms.
Treatment of property CSRepetitions-COL-07-LTLFireability-12 finished in 43768 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 00:24:49] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:24:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 00:24:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 245 transitions and 735 arcs took 4 ms.
Total runtime 269398 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : CSRepetitions-COL-07-LTLFireability-08
Could not compute solution for formula : CSRepetitions-COL-07-LTLFireability-12

BK_STOP 1717201490266

--------------------
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 CSRepetitions-COL-07-LTLFireability-08
ltl formula formula --ltl=/tmp/1540/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, 245 transitions and 735 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.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1540/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1540/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1540/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1540/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name CSRepetitions-COL-07-LTLFireability-12
ltl formula formula --ltl=/tmp/1540/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
pnml2lts-mc( 0/ 4): Petri net has 198 places, 245 transitions and 735 arcs
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1540/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1540/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1540/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1540/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected

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="CSRepetitions-COL-07"
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 CSRepetitions-COL-07, 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 r476-tall-171620505400212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-07.tgz
mv CSRepetitions-COL-07 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 ;