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

--------------------
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 1716415903140

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:11:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 22:11:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:11:44] [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-05-22 22:11:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 22:11:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 507 ms
[2024-05-22 22:11:44] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 22:11:45] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-05-22 22:11:45] [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 331 steps (1 resets) in 11 ms. (27 steps per ms) remains 0/6 properties
[2024-05-22 22:11:45] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:11:45] [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-05-22 22:11:45] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 20 ms.
[2024-05-22 22:11:45] [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-05-22 22:11:45] [INFO ] Computed 50 invariants in 24 ms
[2024-05-22 22:11:45] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 22:11:45] [INFO ] Invariant cache hit.
[2024-05-22 22:11:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:11:45] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:11:45] [INFO ] Invariant cache hit.
[2024-05-22 22:11:45] [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 8155 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 7330 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 15801ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15823ms
Finished structural reductions in LTL mode , in 1 iterations and 16254 ms. Remains : 198/198 places, 245/245 transitions.
Support contains 198 out of 198 places after structural reductions.
[2024-05-22 22:12:01] [INFO ] Flatten gal took : 28 ms
[2024-05-22 22:12:01] [INFO ] Flatten gal took : 44 ms
[2024-05-22 22:12:02] [INFO ] Input system was already deterministic with 245 transitions.
Reduction of identical properties reduced properties to check from 11 to 7
RANDOM walk for 655 steps (6 resets) in 132 ms. (4 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 30 ms. Remains 52 /198 variables (removed 146) and now considering 148/245 (removed 97) transitions.
// Phase 1: matrix 148 rows 52 cols
[2024-05-22 22:12:02] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:12:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 22:12:02] [INFO ] Invariant cache hit.
[2024-05-22 22:12:02] [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-05-22 22:12:02] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 22:12:02] [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 1425 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 1666 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 3139ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3141ms
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 3252 ms. Remains : 52/198 places, 148/245 transitions.
Stuttering acceptance computed with spot in 292 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 35 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-00 finished in 3613 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 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-05-22 22:12:06] [INFO ] Computed 50 invariants in 2 ms
[2024-05-22 22:12:06] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 22:12:06] [INFO ] Invariant cache hit.
[2024-05-22 22:12:06] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:12:06] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:12:06] [INFO ] Invariant cache hit.
[2024-05-22 22:12: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 7333 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 15290ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15294ms
Finished structural reductions in LTL mode , in 1 iterations and 15561 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 161 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 1132 steps with 34 reset in 20 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-07 finished in 15770 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 13 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-22 22:12:21] [INFO ] Invariant cache hit.
[2024-05-22 22:12:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 22:12:21] [INFO ] Invariant cache hit.
[2024-05-22 22:12:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:12:21] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-22 22:12:21] [INFO ] Redundant transitions in 17 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-22 22:12:21] [INFO ] Invariant cache hit.
[2024-05-22 22:12: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 7853 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 7292 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 15311ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15314ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15539 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-08
Product exploration explored 100000 steps with 9517 reset in 694 ms.
Product exploration explored 100000 steps with 9561 reset in 630 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 245 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 32 ms :[(AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 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 298 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 38 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-22 22:12:39] [INFO ] Invariant cache hit.
[2024-05-22 22:12:39] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-22 22:12:39] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 22:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:12:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-22 22:12:40] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-22 22:12:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:12:40] [INFO ] [Nat]Added 49 Read/Feed constraints in 14 ms returned sat
[2024-05-22 22:12:40] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-22 22:12:40] [INFO ] Added : 0 causal constraints over 0 iterations in 39 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-05-22 22:12:40] [INFO ] Invariant cache hit.
[2024-05-22 22:12:40] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 22:12:40] [INFO ] Invariant cache hit.
[2024-05-22 22:12:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:12:40] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-22 22:12:40] [INFO ] Redundant transitions in 3 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-22 22:12:40] [INFO ] Invariant cache hit.
[2024-05-22 22:12:40] [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 7764 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 7067 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 15004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15303 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 206 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 37 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 264 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 40 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-22 22:12:56] [INFO ] Invariant cache hit.
[2024-05-22 22:12:56] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-22 22:12:56] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-22 22:12:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 22:12:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2024-05-22 22:12:56] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-22 22:12:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:12:56] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-22 22:12:56] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 22:12:56] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9556 reset in 582 ms.
Product exploration explored 100000 steps with 9587 reset in 602 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 15 ms. Remains 52 /198 variables (removed 146) and now considering 148/245 (removed 97) transitions.
// Phase 1: matrix 148 rows 52 cols
[2024-05-22 22:12:57] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 22:12:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 22:12:57] [INFO ] Invariant cache hit.
[2024-05-22 22:12:57] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-22 22:12:57] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 22:12:58] [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 1338 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 1611 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 2991ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 2994ms
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 3087 ms. Remains : 52/198 places, 148/245 transitions.
Treatment of property CSRepetitions-COL-07-LTLFireability-08 finished in 39329 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 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-05-22 22:13:01] [INFO ] Computed 50 invariants in 2 ms
[2024-05-22 22:13:01] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 22:13:01] [INFO ] Invariant cache hit.
[2024-05-22 22:13:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:13:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:13:01] [INFO ] Invariant cache hit.
[2024-05-22 22:13:01] [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 7655 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 6872 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 14681ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14683ms
Finished structural reductions in LTL mode , in 1 iterations and 14877 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 132 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 727 ms.
Product exploration explored 100000 steps with 50000 reset in 717 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 19 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 16498 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 9 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-22 22:13:17] [INFO ] Invariant cache hit.
[2024-05-22 22:13:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 22:13:17] [INFO ] Invariant cache hit.
[2024-05-22 22:13:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:13:17] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-22 22:13:17] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-22 22:13:17] [INFO ] Invariant cache hit.
[2024-05-22 22:13:17] [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 7870 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 6950 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 15008ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15214 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 112 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 91 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 15348 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-05-22 22:13:32] [INFO ] Invariant cache hit.
[2024-05-22 22:13:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 22:13:32] [INFO ] Invariant cache hit.
[2024-05-22 22:13:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:13:33] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:13:33] [INFO ] Invariant cache hit.
[2024-05-22 22:13:33] [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 7761 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 7226 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 15149ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 15151ms
Finished structural reductions in LTL mode , in 1 iterations and 15295 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 107 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 1234 reset in 1066 ms.
Product exploration explored 100000 steps with 1218 reset in 1056 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 10 factoid took 291 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
RANDOM walk for 347 steps (3 resets) in 19 ms. (17 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 442 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 113 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
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-05-22 22:13:51] [INFO ] Invariant cache hit.
[2024-05-22 22:13:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 22:13:51] [INFO ] Invariant cache hit.
[2024-05-22 22:13:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:13:51] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:13:51] [INFO ] Invariant cache hit.
[2024-05-22 22:13: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 7684 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 7151 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 14971ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14973ms
Finished structural reductions in LTL mode , in 1 iterations and 15131 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 p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 268 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
RANDOM walk for 382 steps (3 resets) in 31 ms. (11 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 444 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 95 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 110 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 1233 reset in 1116 ms.
Stack based approach found an accepted trace after 28357 steps with 342 reset with depth 94 and stack size 94 in 332 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-11 finished in 36512 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 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-22 22:14:09] [INFO ] Invariant cache hit.
[2024-05-22 22:14:09] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 22:14:09] [INFO ] Invariant cache hit.
[2024-05-22 22:14:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:14:09] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:14:09] [INFO ] Invariant cache hit.
[2024-05-22 22:14:09] [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 7702 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 6978 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 14841ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14843ms
Finished structural reductions in LTL mode , in 1 iterations and 15104 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 84 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 1092 reset in 843 ms.
Stack based approach found an accepted trace after 84256 steps with 921 reset with depth 16 and stack size 16 in 738 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-12 finished in 16795 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-05-22 22:14:26] [INFO ] Invariant cache hit.
[2024-05-22 22:14:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 22:14:26] [INFO ] Invariant cache hit.
[2024-05-22 22:14:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:14:26] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:14:26] [INFO ] Invariant cache hit.
[2024-05-22 22:14:26] [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 7638 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 7030 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 14826ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14829ms
Finished structural reductions in LTL mode , in 1 iterations and 14964 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 145 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 409 ms.
Product exploration explored 100000 steps with 50000 reset in 412 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 14 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 16004 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 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
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 24 ms. Remains 50 /198 variables (removed 148) and now considering 147/245 (removed 98) transitions.
// Phase 1: matrix 147 rows 50 cols
[2024-05-22 22:14:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 22:14:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 22:14:42] [INFO ] Invariant cache hit.
[2024-05-22 22:14:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-22 22:14:42] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-22 22:14:42] [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 1043 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 778 ms.
Refiners :[State Equation: 50/50 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 1831ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 1832ms
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 1922 ms. Remains : 50/198 places, 147/245 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-14
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-14 finished in 1996 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 9 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-05-22 22:14:44] [INFO ] Computed 50 invariants in 2 ms
[2024-05-22 22:14:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 22:14:44] [INFO ] Invariant cache hit.
[2024-05-22 22:14:44] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:14:44] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-22 22:14:44] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-22 22:14:44] [INFO ] Invariant cache hit.
[2024-05-22 22:14:44] [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 7650 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 6975 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 14765ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14767ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14920 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 136 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 1086 reset in 674 ms.
Product exploration explored 100000 steps with 1087 reset in 662 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 41 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
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.
[2024-05-22 22:15:01] [INFO ] Invariant cache hit.
[2024-05-22 22:15:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 22:15:01] [INFO ] Invariant cache hit.
[2024-05-22 22:15:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:15:01] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-22 22:15:01] [INFO ] Redundant transitions in 0 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-22 22:15:01] [INFO ] Invariant cache hit.
[2024-05-22 22:15:01] [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 7522 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 7027 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 14700ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 14702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14853 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 41 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1091 reset in 648 ms.
Stack based approach found an accepted trace after 93552 steps with 1018 reset with depth 133 and stack size 133 in 622 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-15 finished in 33748 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)))'
[2024-05-22 22:15:18] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:15:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 22:15:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 245 transitions and 735 arcs took 3 ms.
Total runtime 213877 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CSRepetitions-COL-07

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1346
MODEL NAME: /home/mcc/execution/412/model
198 places, 245 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716418112131

--------------------
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
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r069-tall-171620504000212"
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 ;