About the Execution of LTSMin+red for CSRepetitions-COL-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 473.252 | 56606.00 | 79583.00 | 312.90 | FFTTTFFFFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505400204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CSRepetitions-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505400204
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Apr 12 09:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 12 09:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 09:23 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.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 12 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 09:45 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 15K 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-05-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717201144177
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:19:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 00:19:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 00:19:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2024-06-01 00:19:06] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 206 PT places and 325.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 00:19:06] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 5 ms.
[2024-06-01 00:19:06] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-COL-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-05-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
RANDOM walk for 278 steps (2 resets) in 12 ms. (21 steps per ms) remains 0/5 properties
[2024-06-01 00:19:06] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:19:06] [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 5
[2024-06-01 00:19:06] [INFO ] Unfolded HLPN to a Petri net with 102 places and 125 transitions 375 arcs in 18 ms.
[2024-06-01 00:19:06] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-05-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2024-06-01 00:19:06] [INFO ] Computed 26 invariants in 15 ms
[2024-06-01 00:19:06] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 00:19:06] [INFO ] Invariant cache hit.
[2024-06-01 00:19:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:06] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:06] [INFO ] Invariant cache hit.
[2024-06-01 00:19:06] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2592 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2082 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4816ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4831ms
Finished structural reductions in LTL mode , in 1 iterations and 5204 ms. Remains : 102/102 places, 125/125 transitions.
Support contains 102 out of 102 places after structural reductions.
[2024-06-01 00:19:11] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:19:11] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:19:11] [INFO ] Input system was already deterministic with 125 transitions.
Reduction of identical properties reduced properties to check from 11 to 8
RANDOM walk for 280 steps (3 resets) in 55 ms. (5 steps per ms) remains 0/8 properties
FORMULA CSRepetitions-COL-05-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 25 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:12] [INFO ] Invariant cache hit.
[2024-06-01 00:19:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 00:19:12] [INFO ] Invariant cache hit.
[2024-06-01 00:19:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:12] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:12] [INFO ] Invariant cache hit.
[2024-06-01 00:19:12] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2106 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4151ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4152ms
Finished structural reductions in LTL mode , in 1 iterations and 4261 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-00
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-00 finished in 4543 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(!p0)) U (X(X(G(!p0)))||(!p1&&X(X(!p0))))))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:16] [INFO ] Invariant cache hit.
[2024-06-01 00:19:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 00:19:16] [INFO ] Invariant cache hit.
[2024-06-01 00:19:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:16] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:16] [INFO ] Invariant cache hit.
[2024-06-01 00:19:16] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2031 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4179ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4180ms
Finished structural reductions in LTL mode , in 1 iterations and 4325 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, true]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-01
Entered a terminal (fully accepting) state of product in 83 steps with 27 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-01 finished in 4515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:21] [INFO ] Invariant cache hit.
[2024-06-01 00:19:21] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 00:19:21] [INFO ] Invariant cache hit.
[2024-06-01 00:19:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:21] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:21] [INFO ] Invariant cache hit.
[2024-06-01 00:19:21] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4211ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4212ms
Finished structural reductions in LTL mode , in 1 iterations and 4323 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLFireability-02 finished in 5000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 52 transition count 100
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 99 place count 28 transition count 76
Iterating global reduction 0 with 24 rules applied. Total rules applied 123 place count 28 transition count 76
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 126 place count 26 transition count 75
Applied a total of 126 rules in 48 ms. Remains 26 /102 variables (removed 76) and now considering 75/125 (removed 50) transitions.
// Phase 1: matrix 75 rows 26 cols
[2024-06-01 00:19:26] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 00:19:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 00:19:26] [INFO ] Invariant cache hit.
[2024-06-01 00:19:26] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 00:19:26] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 00:19:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 75/100 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 0/101 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 26 constraints, problems are : Problem set: 0 solved, 50 unsolved in 362 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 75/100 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 50/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 76 constraints, problems are : Problem set: 0 solved, 50 unsolved in 324 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 691ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/102 places, 75/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 823 ms. Remains : 26/102 places, 75/125 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLFireability-03 finished in 1252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2024-06-01 00:19:27] [INFO ] Computed 26 invariants in 5 ms
[2024-06-01 00:19:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 00:19:27] [INFO ] Invariant cache hit.
[2024-06-01 00:19:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:27] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-01 00:19:27] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:27] [INFO ] Invariant cache hit.
[2024-06-01 00:19:27] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2184 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4211ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4382 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-05-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLFireability-04 finished in 5012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0))||G(!p1))))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:32] [INFO ] Invariant cache hit.
[2024-06-01 00:19:32] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 00:19:32] [INFO ] Invariant cache hit.
[2024-06-01 00:19:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:32] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:32] [INFO ] Invariant cache hit.
[2024-06-01 00:19:32] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4219ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4220ms
Finished structural reductions in LTL mode , in 1 iterations and 4365 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND p1 p0), p0, (AND p1 p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-05
Product exploration explored 100000 steps with 1786 reset in 388 ms.
Stack based approach found an accepted trace after 31192 steps with 557 reset with depth 53 and stack size 53 in 134 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-05 finished in 5018 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)||((!p1 U (p2||G(!p1)))&&X(F(!p1))))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:37] [INFO ] Invariant cache hit.
[2024-06-01 00:19:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 00:19:37] [INFO ] Invariant cache hit.
[2024-06-01 00:19:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:37] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:37] [INFO ] Invariant cache hit.
[2024-06-01 00:19:37] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2105 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4173ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4176ms
Finished structural reductions in LTL mode , in 1 iterations and 4297 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-07
Stuttering criterion allowed to conclude after 456 steps with 18 reset in 14 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-07 finished in 4594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:42] [INFO ] Invariant cache hit.
[2024-06-01 00:19:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:19:42] [INFO ] Invariant cache hit.
[2024-06-01 00:19:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 00:19:42] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:42] [INFO ] Invariant cache hit.
[2024-06-01 00:19:42] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2094 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1997 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4133ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4249 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 47 ms :[p0]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-08
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-08 finished in 4313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:46] [INFO ] Invariant cache hit.
[2024-06-01 00:19:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 00:19:46] [INFO ] Invariant cache hit.
[2024-06-01 00:19:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:46] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-01 00:19:46] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:46] [INFO ] Invariant cache hit.
[2024-06-01 00:19:46] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4104ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4272 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-11
Product exploration explored 100000 steps with 1893 reset in 297 ms.
Stack based approach found an accepted trace after 1046 steps with 20 reset with depth 11 and stack size 11 in 4 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-11 finished in 4734 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(p1))||p0)))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:51] [INFO ] Invariant cache hit.
[2024-06-01 00:19:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 00:19:51] [INFO ] Invariant cache hit.
[2024-06-01 00:19:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:51] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:51] [INFO ] Invariant cache hit.
[2024-06-01 00:19:51] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4091ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4093ms
Finished structural reductions in LTL mode , in 1 iterations and 4256 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-13 finished in 4417 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))&&F((G((F(p2)&&p1))||(G(p2)&&p3)))))'
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 00:19:55] [INFO ] Invariant cache hit.
[2024-06-01 00:19:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 00:19:55] [INFO ] Invariant cache hit.
[2024-06-01 00:19:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 00:19:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-01 00:19:55] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-01 00:19:55] [INFO ] Invariant cache hit.
[2024-06-01 00:19:55] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 153 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2096 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 25/102 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 125/227 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 100/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 253 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4202ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4388 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) p0 (AND (NOT p1) (NOT p3))), p0, (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-14
Product exploration explored 100000 steps with 1841 reset in 312 ms.
Stack based approach found an accepted trace after 36319 steps with 684 reset with depth 7 and stack size 7 in 112 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-14 finished in 5062 ms.
All properties solved by simple procedures.
Total runtime 55331 ms.
ITS solved all properties within timeout
BK_STOP 1717201200783
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CSRepetitions-COL-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505400204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-05.tgz
mv CSRepetitions-COL-05 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 '
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 ;