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.r579-smll-171734921100035.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 MedleyA-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 75K Jun 2 16:33 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 MedleyA-PT-05-LTLCardinality-00
FORMULA_NAME MedleyA-PT-05-LTLCardinality-01
FORMULA_NAME MedleyA-PT-05-LTLCardinality-02
FORMULA_NAME MedleyA-PT-05-LTLCardinality-03
FORMULA_NAME MedleyA-PT-05-LTLCardinality-04
FORMULA_NAME MedleyA-PT-05-LTLCardinality-05
FORMULA_NAME MedleyA-PT-05-LTLCardinality-06
FORMULA_NAME MedleyA-PT-05-LTLCardinality-07
FORMULA_NAME MedleyA-PT-05-LTLCardinality-08
FORMULA_NAME MedleyA-PT-05-LTLCardinality-09
FORMULA_NAME MedleyA-PT-05-LTLCardinality-10
FORMULA_NAME MedleyA-PT-05-LTLCardinality-11
FORMULA_NAME MedleyA-PT-05-LTLCardinality-12
FORMULA_NAME MedleyA-PT-05-LTLCardinality-13
FORMULA_NAME MedleyA-PT-05-LTLCardinality-14
FORMULA_NAME MedleyA-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717352529502

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:22:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:22:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:22:12] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-06-02 18:22:12] [INFO ] Transformed 115 places.
[2024-06-02 18:22:12] [INFO ] Transformed 257 transitions.
[2024-06-02 18:22:12] [INFO ] Found NUPN structural information;
[2024-06-02 18:22:12] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA MedleyA-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 103 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 103 transition count 230
Applied a total of 24 rules in 48 ms. Remains 103 /115 variables (removed 12) and now considering 230/254 (removed 24) transitions.
[2024-06-02 18:22:13] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
// Phase 1: matrix 229 rows 103 cols
[2024-06-02 18:22:13] [INFO ] Computed 20 invariants in 30 ms
[2024-06-02 18:22:13] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-06-02 18:22:13] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
[2024-06-02 18:22:13] [INFO ] Invariant cache hit.
[2024-06-02 18:22:13] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:22:14] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-06-02 18:22:14] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
[2024-06-02 18:22:14] [INFO ] Invariant cache hit.
[2024-06-02 18:22:14] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-02 18:22:17] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 18 ms to minimize.
[2024-06-02 18:22:17] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-06-02 18:22:17] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:22:18] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 228/331 variables, 103/127 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 93/220 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 1/332 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-02 18:22:24] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 222 constraints, problems are : Problem set: 0 solved, 229 unsolved in 17404 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 228/331 variables, 103/129 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 93/222 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 229/451 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 1/332 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (OVERLAPS) 0/332 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 452 constraints, problems are : Problem set: 0 solved, 229 unsolved in 17647 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 6/6 constraints]
After SMT, in 35635ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 35679ms
Starting structural reductions in LTL mode, iteration 1 : 103/115 places, 230/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36747 ms. Remains : 103/115 places, 230/254 transitions.
Support contains 28 out of 103 places after structural reductions.
[2024-06-02 18:22:50] [INFO ] Flatten gal took : 72 ms
[2024-06-02 18:22:50] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:22:50] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (2991 resets) in 1625 ms. (24 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40004 steps (474 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (562 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (477 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (461 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (480 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
[2024-06-02 18:22:51] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
[2024-06-02 18:22:51] [INFO ] Invariant cache hit.
[2024-06-02 18:22:51] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/88 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/101 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 227/328 variables, 101/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 93/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/331 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/332 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/332 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 217 constraints, problems are : Problem set: 0 solved, 5 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/88 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/101 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 227/328 variables, 101/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 93/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/331 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/332 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/332 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 222 constraints, problems are : Problem set: 0 solved, 5 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 920ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 1118 steps, including 24 resets, run visited all 5 properties in 8 ms. (steps per millisecond=139 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 17 ms.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 101 transition count 228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 9 place count 95 transition count 216
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 95 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 86 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 86 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 60 place count 86 transition count 266
Applied a total of 60 rules in 84 ms. Remains 86 /103 variables (removed 17) and now considering 266/230 (removed -36) transitions.
[2024-06-02 18:22:52] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
// Phase 1: matrix 265 rows 86 cols
[2024-06-02 18:22:52] [INFO ] Computed 20 invariants in 6 ms
[2024-06-02 18:22:52] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 18:22:52] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
[2024-06-02 18:22:52] [INFO ] Invariant cache hit.
[2024-06-02 18:22:52] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 18:22:52] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 18:22:52] [INFO ] Redundant transitions in 86 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 18:22:52] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
[2024-06-02 18:22:52] [INFO ] Invariant cache hit.
[2024-06-02 18:22:52] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:22:55] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 264/350 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 141/248 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/351 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 249 constraints, problems are : Problem set: 0 solved, 264 unsolved in 12126 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 264/350 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 141/248 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 264/512 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 1/351 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 513 constraints, problems are : Problem set: 0 solved, 264 unsolved in 18679 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 1/1 constraints]
After SMT, in 31350ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 31355ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/103 places, 266/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31892 ms. Remains : 86/103 places, 266/230 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-00 finished in 32224 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(p0))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 218
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 218
Applied a total of 12 rules in 10 ms. Remains 97 /103 variables (removed 6) and now considering 218/230 (removed 12) transitions.
[2024-06-02 18:23:24] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:23:24] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:23:24] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:23:24] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:23:24] [INFO ] Invariant cache hit.
[2024-06-02 18:23:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:23:24] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:23:24] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:23:24] [INFO ] Invariant cache hit.
[2024-06-02 18:23:24] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9187 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13108 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 22427ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 22430ms
Starting structural reductions in LTL mode, iteration 1 : 97/103 places, 218/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22711 ms. Remains : 97/103 places, 218/230 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-02 finished in 22822 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(F(p1))||p0))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 220
Applied a total of 10 rules in 5 ms. Remains 98 /103 variables (removed 5) and now considering 220/230 (removed 10) transitions.
[2024-06-02 18:23:47] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 18:23:47] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:23:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:23:47] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:23:47] [INFO ] Invariant cache hit.
[2024-06-02 18:23:47] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:23:47] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-02 18:23:47] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:23:47] [INFO ] Invariant cache hit.
[2024-06-02 18:23:47] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:23:49] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 213 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 432 constraints, problems are : Problem set: 0 solved, 219 unsolved in 13110 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints]
After SMT, in 22281ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 22284ms
Starting structural reductions in LTL mode, iteration 1 : 98/103 places, 220/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22574 ms. Remains : 98/103 places, 220/230 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 860 ms.
Product exploration explored 100000 steps with 50000 reset in 605 ms.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 495 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 84 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-05-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-05-LTLCardinality-03 finished in 24217 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 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 220
Applied a total of 10 rules in 5 ms. Remains 98 /103 variables (removed 5) and now considering 220/230 (removed 10) transitions.
[2024-06-02 18:24:11] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 18:24:11] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 18:24:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:24:11] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:24:11] [INFO ] Invariant cache hit.
[2024-06-02 18:24:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:24:11] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-02 18:24:11] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:24:11] [INFO ] Invariant cache hit.
[2024-06-02 18:24:11] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:24:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:24:13] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 214 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9979 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 433 constraints, problems are : Problem set: 0 solved, 219 unsolved in 12966 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
After SMT, in 23072ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 23075ms
Starting structural reductions in LTL mode, iteration 1 : 98/103 places, 220/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23370 ms. Remains : 98/103 places, 220/230 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-04 finished in 23521 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((X(F(X(p0))) U p1))&&X(G(p0)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 100 transition count 227
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 9 place count 94 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 94 transition count 215
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 86 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 86 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 47 place count 86 transition count 247
Applied a total of 47 rules in 37 ms. Remains 86 /103 variables (removed 17) and now considering 247/230 (removed -17) transitions.
[2024-06-02 18:24:35] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
// Phase 1: matrix 246 rows 86 cols
[2024-06-02 18:24:35] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:24:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:24:35] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:24:35] [INFO ] Invariant cache hit.
[2024-06-02 18:24:35] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 18:24:35] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-06-02 18:24:35] [INFO ] Redundant transitions in 49 ms returned []
Running 238 sub problems to find dead transitions.
[2024-06-02 18:24:35] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:24:35] [INFO ] Invariant cache hit.
[2024-06-02 18:24:35] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 245/331 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 1/332 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 136 constraints, problems are : Problem set: 0 solved, 238 unsolved in 9419 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 245/331 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 238/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 1/332 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 0/332 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 374 constraints, problems are : Problem set: 0 solved, 238 unsolved in 13860 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
After SMT, in 23558ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 23561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/103 places, 247/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23912 ms. Remains : 86/103 places, 247/230 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-07
Product exploration explored 100000 steps with 2 reset in 138 ms.
Product exploration explored 100000 steps with 1 reset in 200 ms.
Computed a total of 10 stabilizing places and 117 stable transitions
Computed a total of 10 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (3785 resets) in 408 ms. (97 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (503 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2024-06-02 18:24:59] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:24:59] [INFO ] Invariant cache hit.
[2024-06-02 18:24:59] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/51 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 200/261 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 45/306 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/317 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/320 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/331 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/332 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/332 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/51 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 200/261 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 45/306 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/317 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/320 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/331 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/331 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/332 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 247/247 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 245
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 18 place count 86 transition count 417
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 50 place count 70 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 163 transitions
Redundant transition composition rules discarded 163 transitions
Iterating global reduction 2 with 163 rules applied. Total rules applied 213 place count 70 transition count 238
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 70 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 69 transition count 257
Applied a total of 215 rules in 51 ms. Remains 69 /86 variables (removed 17) and now considering 257/247 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 69/86 places, 257/247 transitions.
RANDOM walk for 40000 steps (4198 resets) in 545 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (622 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 237364 steps, run visited all 1 properties in 620 ms. (steps per millisecond=382 )
Probabilistic random walk after 237364 steps, saw 44352 distinct states, run finished after 625 ms. (steps per millisecond=379 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p1)]
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 247/247 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2024-06-02 18:25:01] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:25:01] [INFO ] Invariant cache hit.
[2024-06-02 18:25:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:25:01] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:25:01] [INFO ] Invariant cache hit.
[2024-06-02 18:25:01] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 18:25:01] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 18:25:01] [INFO ] Redundant transitions in 64 ms returned []
Running 238 sub problems to find dead transitions.
[2024-06-02 18:25:01] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:25:01] [INFO ] Invariant cache hit.
[2024-06-02 18:25:01] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 245/331 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 1/332 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 136 constraints, problems are : Problem set: 0 solved, 238 unsolved in 9753 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 245/331 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 238/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 1/332 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 0/332 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 374 constraints, problems are : Problem set: 0 solved, 238 unsolved in 14239 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
After SMT, in 24248ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 24251ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24627 ms. Remains : 86/86 places, 247/247 transitions.
Computed a total of 10 stabilizing places and 117 stable transitions
Computed a total of 10 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (3767 resets) in 320 ms. (124 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (510 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-06-02 18:25:26] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:25:26] [INFO ] Invariant cache hit.
[2024-06-02 18:25:26] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/51 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 200/261 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 45/306 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/317 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/320 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/331 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/332 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/332 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/51 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 200/261 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 45/306 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/317 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/320 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/331 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/331 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/332 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 247/247 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 245
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 18 place count 86 transition count 417
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 50 place count 70 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 163 transitions
Redundant transition composition rules discarded 163 transitions
Iterating global reduction 2 with 163 rules applied. Total rules applied 213 place count 70 transition count 238
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 70 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 69 transition count 257
Applied a total of 215 rules in 40 ms. Remains 69 /86 variables (removed 17) and now considering 257/247 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 69/86 places, 257/247 transitions.
RANDOM walk for 40000 steps (4259 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (623 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 237364 steps, run visited all 1 properties in 531 ms. (steps per millisecond=447 )
Probabilistic random walk after 237364 steps, saw 44352 distinct states, run finished after 531 ms. (steps per millisecond=447 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 74 ms.
Product exploration explored 100000 steps with 4 reset in 133 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 247/247 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2024-06-02 18:25:28] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:25:28] [INFO ] Invariant cache hit.
[2024-06-02 18:25:28] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:25:28] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:25:28] [INFO ] Invariant cache hit.
[2024-06-02 18:25:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 18:25:28] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 18:25:28] [INFO ] Redundant transitions in 51 ms returned []
Running 238 sub problems to find dead transitions.
[2024-06-02 18:25:28] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 18:25:28] [INFO ] Invariant cache hit.
[2024-06-02 18:25:28] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 245/331 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 1/332 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 136 constraints, problems are : Problem set: 0 solved, 238 unsolved in 9338 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 245/331 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 238/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 1/332 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 0/332 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 374 constraints, problems are : Problem set: 0 solved, 238 unsolved in 14104 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
After SMT, in 23704ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 23707ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24064 ms. Remains : 86/86 places, 247/247 transitions.
Treatment of property MedleyA-PT-05-LTLCardinality-07 finished in 77343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p1))||G(p2))&&p0)))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 222
Applied a total of 8 rules in 3 ms. Remains 99 /103 variables (removed 4) and now considering 222/230 (removed 8) transitions.
[2024-06-02 18:25:52] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 18:25:52] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 18:25:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:25:52] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:25:52] [INFO ] Invariant cache hit.
[2024-06-02 18:25:52] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:25:52] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:25:52] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:25:52] [INFO ] Invariant cache hit.
[2024-06-02 18:25:52] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:25:54] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 214 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9493 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 435 constraints, problems are : Problem set: 0 solved, 221 unsolved in 13969 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 23596ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 23599ms
Starting structural reductions in LTL mode, iteration 1 : 99/103 places, 222/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23869 ms. Remains : 99/103 places, 222/230 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-09 finished in 24070 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&&X(p1)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 222
Applied a total of 8 rules in 3 ms. Remains 99 /103 variables (removed 4) and now considering 222/230 (removed 8) transitions.
[2024-06-02 18:26:16] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 18:26:16] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:26:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:26:16] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:26:16] [INFO ] Invariant cache hit.
[2024-06-02 18:26:16] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:26:16] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:26:16] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:26:16] [INFO ] Invariant cache hit.
[2024-06-02 18:26:16] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:26:18] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:26:18] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 215 constraints, problems are : Problem set: 0 solved, 221 unsolved in 13141 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 436 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16686 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
After SMT, in 29963ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 29966ms
Starting structural reductions in LTL mode, iteration 1 : 99/103 places, 222/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30253 ms. Remains : 99/103 places, 222/230 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-13 finished in 30437 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 (p1&&X(G(!p0)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 100 transition count 227
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 8 place count 95 transition count 217
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 95 transition count 217
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 87 transition count 269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 87 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 42 place count 87 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 86 transition count 255
Applied a total of 44 rules in 22 ms. Remains 86 /103 variables (removed 17) and now considering 255/230 (removed -25) transitions.
[2024-06-02 18:26:46] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
// Phase 1: matrix 254 rows 86 cols
[2024-06-02 18:26:46] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:26:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 18:26:46] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 18:26:46] [INFO ] Invariant cache hit.
[2024-06-02 18:26:47] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 18:26:47] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-06-02 18:26:47] [INFO ] Redundant transitions in 53 ms returned []
Running 246 sub problems to find dead transitions.
[2024-06-02 18:26:47] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 18:26:47] [INFO ] Invariant cache hit.
[2024-06-02 18:26:47] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-06-02 18:26:51] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 136 constraints, problems are : Problem set: 0 solved, 246 unsolved in 14309 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 246/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 382 constraints, problems are : Problem set: 0 solved, 246 unsolved in 17985 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
After SMT, in 32750ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 32755ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/103 places, 255/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33223 ms. Remains : 86/103 places, 255/230 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 22 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-15 finished in 33355 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((X(F(X(p0))) U p1))&&X(G(p0)))))'
[2024-06-02 18:27:20] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:27:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-02 18:27:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 230 transitions and 1103 arcs took 16 ms.
Total runtime 308279 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-05-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717352841531

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-05-LTLCardinality-07
ltl formula formula --ltl=/tmp/995/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 103 places, 230 transitions and 1103 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/995/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/995/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/995/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/995/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 104 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 104, there are 283 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~50 levels ~10000 states ~43904 transitions
pnml2lts-mc( 3/ 4): ~50 levels ~20000 states ~76112 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~31!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16676
pnml2lts-mc( 0/ 4): unique states count: 28458
pnml2lts-mc( 0/ 4): unique transitions count: 132040
pnml2lts-mc( 0/ 4): - self-loop count: 4333
pnml2lts-mc( 0/ 4): - claim dead count: 84257
pnml2lts-mc( 0/ 4): - claim found count: 14200
pnml2lts-mc( 0/ 4): - claim success count: 28486
pnml2lts-mc( 0/ 4): - cum. max stack depth: 431
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28513 states 132363 transitions, fanout: 4.642
pnml2lts-mc( 0/ 4): Total exploration time 0.450 sec (0.430 sec minimum, 0.445 sec on average)
pnml2lts-mc( 0/ 4): States per second: 63362, Transitions per second: 294140
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 9.7 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 230 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-05"
export BK_EXAMINATION="LTLCardinality"
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 MedleyA-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921100035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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