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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 33K 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-06-LTLCardinality-00
FORMULA_NAME MedleyA-PT-06-LTLCardinality-01
FORMULA_NAME MedleyA-PT-06-LTLCardinality-02
FORMULA_NAME MedleyA-PT-06-LTLCardinality-03
FORMULA_NAME MedleyA-PT-06-LTLCardinality-04
FORMULA_NAME MedleyA-PT-06-LTLCardinality-05
FORMULA_NAME MedleyA-PT-06-LTLCardinality-06
FORMULA_NAME MedleyA-PT-06-LTLCardinality-07
FORMULA_NAME MedleyA-PT-06-LTLCardinality-08
FORMULA_NAME MedleyA-PT-06-LTLCardinality-09
FORMULA_NAME MedleyA-PT-06-LTLCardinality-10
FORMULA_NAME MedleyA-PT-06-LTLCardinality-11
FORMULA_NAME MedleyA-PT-06-LTLCardinality-12
FORMULA_NAME MedleyA-PT-06-LTLCardinality-13
FORMULA_NAME MedleyA-PT-06-LTLCardinality-14
FORMULA_NAME MedleyA-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717353698786

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:41:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:41:41] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-02 18:41:41] [INFO ] Transformed 124 places.
[2024-06-02 18:41:41] [INFO ] Transformed 118 transitions.
[2024-06-02 18:41:41] [INFO ] Found NUPN structural information;
[2024-06-02 18:41:41] [INFO ] Parsed PT model containing 124 places and 118 transitions and 372 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 118/118 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 118
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 106 transition count 94
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 106 transition count 94
Applied a total of 31 rules in 78 ms. Remains 106 /124 variables (removed 18) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 106 cols
[2024-06-02 18:41:42] [INFO ] Computed 19 invariants in 31 ms
[2024-06-02 18:41:42] [INFO ] Implicit Places using invariants in 472 ms returned [23, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 541 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/124 places, 94/118 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 669 ms. Remains : 104/124 places, 94/118 transitions.
Support contains 26 out of 104 places after structural reductions.
[2024-06-02 18:41:43] [INFO ] Flatten gal took : 61 ms
[2024-06-02 18:41:43] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:41:43] [INFO ] Input system was already deterministic with 94 transitions.
RANDOM walk for 39252 steps (1094 resets) in 1653 ms. (23 steps per ms) remains 0/19 properties
FORMULA MedleyA-PT-06-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 87
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 86
Applied a total of 16 rules in 26 ms. Remains 96 /104 variables (removed 8) and now considering 86/94 (removed 8) transitions.
// Phase 1: matrix 86 rows 96 cols
[2024-06-02 18:41:44] [INFO ] Computed 17 invariants in 5 ms
[2024-06-02 18:41:44] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-02 18:41:44] [INFO ] Invariant cache hit.
[2024-06-02 18:41:44] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:41:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:41:46] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 21 ms to minimize.
[2024-06-02 18:41:46] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:41:46] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/182 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:41:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:41:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 118 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4654 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/182 variables, 96/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 85/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 203 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3215 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
After SMT, in 7955ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 7975ms
Starting structural reductions in LTL mode, iteration 1 : 96/104 places, 86/94 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8440 ms. Remains : 96/104 places, 86/94 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 217 steps with 5 reset in 6 ms.
FORMULA MedleyA-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLCardinality-02 finished in 8891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p1)||p0)))||G(p2))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 86
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 95 transition count 86
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 15 place count 95 transition count 80
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 89 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 82 transition count 73
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 82 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 41 place count 82 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 80 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 78 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 78 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 52 place count 77 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 76 transition count 67
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 99 place count 53 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 111 place count 47 transition count 53
Applied a total of 111 rules in 53 ms. Remains 47 /104 variables (removed 57) and now considering 53/94 (removed 41) transitions.
// Phase 1: matrix 53 rows 47 cols
[2024-06-02 18:41:53] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 18:41:53] [INFO ] Implicit Places using invariants in 65 ms returned [14, 22, 26, 29, 40]
[2024-06-02 18:41:53] [INFO ] Actually due to overlaps returned [26, 40, 14, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/104 places, 53/94 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 43 transition count 52
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 40 transition count 50
Applied a total of 6 rules in 11 ms. Remains 40 /43 variables (removed 3) and now considering 50/53 (removed 3) transitions.
// Phase 1: matrix 50 rows 40 cols
[2024-06-02 18:41:53] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 18:41:53] [INFO ] Implicit Places using invariants in 74 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/104 places, 50/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 220 ms. Remains : 39/104 places, 50/94 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-04
Product exploration explored 100000 steps with 9675 reset in 633 ms.
Product exploration explored 100000 steps with 9707 reset in 329 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 386 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3849 resets) in 290 ms. (137 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (957 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (945 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
// Phase 1: matrix 50 rows 39 cols
[2024-06-02 18:41:55] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:41:55] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/30 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 50/89 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 60 constraints, problems are : Problem set: 0 solved, 2 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/30 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:41:55] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Int declared 39/89 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/39 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 253ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1)), (G (OR p2 p0 p1)), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (OR p2 p0) (OR p0 p1)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 43 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-06-LTLCardinality-04 finished in 2389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 102 transition count 87
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 96 transition count 87
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 96 transition count 80
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 89 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 82 transition count 73
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 82 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 41 place count 82 transition count 71
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 80 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 78 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 78 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 52 place count 77 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 76 transition count 67
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 97 place count 54 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 107 place count 49 transition count 54
Applied a total of 107 rules in 38 ms. Remains 49 /104 variables (removed 55) and now considering 54/94 (removed 40) transitions.
// Phase 1: matrix 54 rows 49 cols
[2024-06-02 18:41:55] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 18:41:55] [INFO ] Implicit Places using invariants in 103 ms returned [14, 22, 26, 30, 41]
[2024-06-02 18:41:55] [INFO ] Actually due to overlaps returned [41, 14, 26, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 106 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/104 places, 54/94 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 45 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 43 transition count 52
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 0 with 2 rules applied. Total rules applied 6 place count 42 transition count 51
Applied a total of 6 rules in 10 ms. Remains 42 /45 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 42 cols
[2024-06-02 18:41:55] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 18:41:55] [INFO ] Implicit Places using invariants in 69 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/104 places, 51/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 230 ms. Remains : 41/104 places, 51/94 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-05
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLCardinality-05 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 94
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 95 transition count 86
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 95 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 93 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 93 transition count 84
Applied a total of 21 rules in 9 ms. Remains 93 /104 variables (removed 11) and now considering 84/94 (removed 10) transitions.
// Phase 1: matrix 84 rows 93 cols
[2024-06-02 18:41:55] [INFO ] Computed 16 invariants in 3 ms
[2024-06-02 18:41:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:41:56] [INFO ] Invariant cache hit.
[2024-06-02 18:41:56] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-06-02 18:41:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-02 18:41:57] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:41:57] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
[2024-06-02 18:41:57] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/177 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-02 18:41:58] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 113 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4201 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/177 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 83/196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 196 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3542 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
After SMT, in 7780ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 7784ms
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 84/94 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8024 ms. Remains : 93/104 places, 84/94 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLCardinality-06 finished in 8235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 97 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 95 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 95 transition count 86
Applied a total of 17 rules in 7 ms. Remains 95 /104 variables (removed 9) and now considering 86/94 (removed 8) transitions.
// Phase 1: matrix 86 rows 95 cols
[2024-06-02 18:42:04] [INFO ] Computed 16 invariants in 3 ms
[2024-06-02 18:42:04] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 18:42:04] [INFO ] Invariant cache hit.
[2024-06-02 18:42:04] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:42:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:42:06] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:06] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:42:06] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 86/181 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:08] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5757 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/181 variables, 95/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:11] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:12] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:42:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:13] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 208 constraints, problems are : Problem set: 0 solved, 85 unsolved in 6930 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 12/12 constraints]
After SMT, in 12716ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 12720ms
Starting structural reductions in LTL mode, iteration 1 : 95/104 places, 86/94 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13062 ms. Remains : 95/104 places, 86/94 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 333 ms.
Product exploration explored 100000 steps with 25000 reset in 239 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 449 steps (10 resets) in 4 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-02 18:42:18] [INFO ] Invariant cache hit.
[2024-06-02 18:42:19] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 18:42:19] [INFO ] Invariant cache hit.
[2024-06-02 18:42:19] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:42:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:20] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:42:20] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:42:20] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:42:20] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:20] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:42:20] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 86/181 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:22] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/181 variables, 95/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:42:26] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 208 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5241 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 12/12 constraints]
After SMT, in 10391ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 10394ms
Finished structural reductions in LTL mode , in 1 iterations and 10718 ms. Remains : 95/95 places, 86/86 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 397 steps (8 resets) in 6 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 206 ms.
Product exploration explored 100000 steps with 25000 reset in 291 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 86/86 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 95 transition count 85
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 95 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 95 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 93 transition count 85
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 93 transition count 85
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 43 place count 93 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 92 transition count 84
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 92 transition count 84
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 92 transition count 116
Deduced a syphon composed of 40 places in 1 ms
Applied a total of 50 rules in 22 ms. Remains 92 /95 variables (removed 3) and now considering 116/86 (removed -30) transitions.
[2024-06-02 18:42:31] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 116 rows 92 cols
[2024-06-02 18:42:31] [INFO ] Computed 16 invariants in 2 ms
[2024-06-02 18:42:31] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-02 18:42:32] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 9 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 15/31 constraints. Problems are: Problem set: 66 solved, 46 unsolved
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/32 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/32 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 116/208 variables, 92/124 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 7/131 constraints. Problems are: Problem set: 66 solved, 46 unsolved
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/132 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/132 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/132 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 132 constraints, problems are : Problem set: 66 solved, 46 unsolved in 3557 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 66 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 31/82 variables, 11/11 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 17/28 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/28 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 10/92 variables, 5/33 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/33 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/125 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 7/132 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 46/178 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/178 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/178 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 178 constraints, problems are : Problem set: 66 solved, 46 unsolved in 2611 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 46/112 constraints, Known Traps: 17/17 constraints]
After SMT, in 6219ms problems are : Problem set: 66 solved, 46 unsolved
Search for dead transitions found 66 dead transitions in 6223ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 92/95 places, 50/86 transitions.
Graph (complete) has 152 edges and 92 vertex of which 52 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 0 output transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 51 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 51 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 58
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 5 rules in 17 ms. Remains 51 /92 variables (removed 41) and now considering 58/50 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/95 places, 58/86 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6275 ms. Remains : 51/95 places, 58/86 transitions.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 95 cols
[2024-06-02 18:42:37] [INFO ] Computed 16 invariants in 2 ms
[2024-06-02 18:42:37] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:42:37] [INFO ] Invariant cache hit.
[2024-06-02 18:42:38] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:39] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:42:39] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:42:39] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:42:39] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:39] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:42:39] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 86/181 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5065 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/181 variables, 95/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:42:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:42:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 208 constraints, problems are : Problem set: 0 solved, 85 unsolved in 6549 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 12/12 constraints]
After SMT, in 11631ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 11633ms
Finished structural reductions in LTL mode , in 1 iterations and 11878 ms. Remains : 95/95 places, 86/86 transitions.
Treatment of property MedleyA-PT-06-LTLCardinality-10 finished in 45615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 97 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 96 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 96 transition count 87
Applied a total of 15 rules in 5 ms. Remains 96 /104 variables (removed 8) and now considering 87/94 (removed 7) transitions.
// Phase 1: matrix 87 rows 96 cols
[2024-06-02 18:42:49] [INFO ] Computed 16 invariants in 2 ms
[2024-06-02 18:42:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 18:42:49] [INFO ] Invariant cache hit.
[2024-06-02 18:42:50] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-06-02 18:42:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:42:51] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 3 ms to minimize.
[2024-06-02 18:42:51] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:42:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:42:51] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/183 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 116 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2852 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/183 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 86/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 202 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints]
After SMT, in 6405ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 6406ms
Starting structural reductions in LTL mode, iteration 1 : 96/104 places, 87/94 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6620 ms. Remains : 96/104 places, 87/94 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 2775 reset in 304 ms.
Product exploration explored 100000 steps with 2771 reset in 377 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
RANDOM walk for 267 steps (5 resets) in 4 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Support contains 2 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 87/87 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 95 transition count 80
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 89 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 88 transition count 78
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 15 place count 88 transition count 68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 35 place count 78 transition count 68
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 77 transition count 68
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 80 place count 55 transition count 46
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 90 place count 50 transition count 54
Applied a total of 90 rules in 22 ms. Remains 50 /96 variables (removed 46) and now considering 54/87 (removed 33) transitions.
// Phase 1: matrix 54 rows 50 cols
[2024-06-02 18:42:57] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 18:42:57] [INFO ] Implicit Places using invariants in 111 ms returned [16, 26, 30, 33, 43]
[2024-06-02 18:42:57] [INFO ] Actually due to overlaps returned [30, 43, 16, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 113 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/96 places, 54/87 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 46 transition count 52
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 41 transition count 49
Applied a total of 10 rules in 8 ms. Remains 41 /46 variables (removed 5) and now considering 49/54 (removed 5) transitions.
// Phase 1: matrix 49 rows 41 cols
[2024-06-02 18:42:57] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 18:42:57] [INFO ] Implicit Places using invariants in 75 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/96 places, 49/87 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 55
Applied a total of 2 rules in 6 ms. Remains 39 /40 variables (removed 1) and now considering 55/49 (removed -6) transitions.
// Phase 1: matrix 55 rows 39 cols
[2024-06-02 18:42:58] [INFO ] Computed 10 invariants in 0 ms
[2024-06-02 18:42:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:42:58] [INFO ] Invariant cache hit.
[2024-06-02 18:42:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:42:58] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 39/96 places, 55/87 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 373 ms. Remains : 39/96 places, 55/87 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
RANDOM walk for 96 steps (12 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 10198 reset in 181 ms.
Product exploration explored 100000 steps with 10193 reset in 231 ms.
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 55/55 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 38 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 38 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 53
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 0 with 2 rules applied. Total rules applied 6 place count 36 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 35 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 35 transition count 51
Applied a total of 8 rules in 12 ms. Remains 35 /39 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 35 cols
[2024-06-02 18:42:59] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:42:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:42:59] [INFO ] Invariant cache hit.
[2024-06-02 18:42:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:42:59] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 18:42:59] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-02 18:42:59] [INFO ] Invariant cache hit.
[2024-06-02 18:42:59] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/35 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-02 18:42:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 51/86 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 61 constraints, problems are : Problem set: 0 solved, 39 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/35 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 51/86 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 100 constraints, problems are : Problem set: 0 solved, 39 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 1968ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/39 places, 51/55 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2137 ms. Remains : 35/39 places, 51/55 transitions.
Treatment of property MedleyA-PT-06-LTLCardinality-12 finished in 11417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 86
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 95 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 95 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 88 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 81 transition count 72
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 81 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 43 place count 81 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 78 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 77 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 77 transition count 68
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 91 place count 57 transition count 48
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 51 transition count 57
Applied a total of 103 rules in 18 ms. Remains 51 /104 variables (removed 53) and now considering 57/94 (removed 37) transitions.
// Phase 1: matrix 57 rows 51 cols
[2024-06-02 18:43:01] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 18:43:01] [INFO ] Implicit Places using invariants in 79 ms returned [7, 19, 26, 30, 33]
[2024-06-02 18:43:01] [INFO ] Actually due to overlaps returned [30, 19, 7, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 81 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/104 places, 57/94 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 47 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 44 transition count 54
Applied a total of 6 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 54/57 (removed 3) transitions.
// Phase 1: matrix 54 rows 44 cols
[2024-06-02 18:43:01] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 18:43:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:43:01] [INFO ] Invariant cache hit.
[2024-06-02 18:43:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 18:43:01] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/104 places, 54/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 44/104 places, 54/94 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-14
Product exploration explored 100000 steps with 12660 reset in 119 ms.
Stack based approach found an accepted trace after 22878 steps with 2887 reset with depth 10 and stack size 10 in 29 ms.
FORMULA MedleyA-PT-06-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-06-LTLCardinality-14 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0)&&!(p0 U p1)))&&F(p2))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 102 transition count 87
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 96 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 95 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 15 place count 95 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 29 place count 88 transition count 79
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 36 place count 81 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 43 place count 81 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 81 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 78 transition count 69
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 76 transition count 67
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 76 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 75 transition count 66
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 99 place count 53 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 109 place count 48 transition count 53
Applied a total of 109 rules in 15 ms. Remains 48 /104 variables (removed 56) and now considering 53/94 (removed 41) transitions.
// Phase 1: matrix 53 rows 48 cols
[2024-06-02 18:43:01] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 18:43:01] [INFO ] Implicit Places using invariants in 64 ms returned [15, 23, 27, 31, 41]
[2024-06-02 18:43:01] [INFO ] Actually due to overlaps returned [41, 15, 27, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/104 places, 53/94 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 44 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 40 transition count 49
Applied a total of 8 rules in 4 ms. Remains 40 /44 variables (removed 4) and now considering 49/53 (removed 4) transitions.
// Phase 1: matrix 49 rows 40 cols
[2024-06-02 18:43:01] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 18:43:01] [INFO ] Implicit Places using invariants in 49 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/104 places, 49/94 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 48
Applied a total of 2 rules in 2 ms. Remains 38 /39 variables (removed 1) and now considering 48/49 (removed 1) transitions.
// Phase 1: matrix 48 rows 38 cols
[2024-06-02 18:43:01] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:43:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 18:43:01] [INFO ] Invariant cache hit.
[2024-06-02 18:43:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 18:43:02] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 38/104 places, 48/94 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 255 ms. Remains : 38/104 places, 48/94 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p2) p1), p1, (NOT p0), (NOT p2)]
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-15
Stuttering criterion allowed to conclude after 36859 steps with 4120 reset in 99 ms.
FORMULA MedleyA-PT-06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLCardinality-15 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : MedleyA-PT-06-LTLCardinality-10
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 86
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 95 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 95 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 88 transition count 79
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 35 place count 82 transition count 73
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 82 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 41 place count 82 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 80 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 78 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 78 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 52 place count 77 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 76 transition count 67
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 97 place count 54 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 109 place count 48 transition count 54
Applied a total of 109 rules in 15 ms. Remains 48 /104 variables (removed 56) and now considering 54/94 (removed 40) transitions.
// Phase 1: matrix 54 rows 48 cols
[2024-06-02 18:43:02] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 18:43:02] [INFO ] Implicit Places using invariants in 75 ms returned [15, 23, 27, 30, 40]
[2024-06-02 18:43:02] [INFO ] Actually due to overlaps returned [27, 40, 15, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 44/104 places, 54/94 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 44 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 50
Applied a total of 8 rules in 4 ms. Remains 40 /44 variables (removed 4) and now considering 50/54 (removed 4) transitions.
// Phase 1: matrix 50 rows 40 cols
[2024-06-02 18:43:02] [INFO ] Computed 11 invariants in 0 ms
[2024-06-02 18:43:02] [INFO ] Implicit Places using invariants in 49 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 39/104 places, 50/94 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 56
Applied a total of 2 rules in 2 ms. Remains 38 /39 variables (removed 1) and now considering 56/50 (removed -6) transitions.
// Phase 1: matrix 56 rows 38 cols
[2024-06-02 18:43:02] [INFO ] Computed 10 invariants in 0 ms
[2024-06-02 18:43:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:43:02] [INFO ] Invariant cache hit.
[2024-06-02 18:43:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:43:02] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 38/104 places, 56/94 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 289 ms. Remains : 38/104 places, 56/94 transitions.
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 199 ms.
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 291 steps (22 resets) in 6 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 56/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-02 18:43:04] [INFO ] Invariant cache hit.
[2024-06-02 18:43:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 18:43:04] [INFO ] Invariant cache hit.
[2024-06-02 18:43:04] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:43:04] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 18:43:04] [INFO ] Invariant cache hit.
[2024-06-02 18:43:04] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:43:04] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 56/94 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 56/94 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/94 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
After SMT, in 2544ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2546ms
Finished structural reductions in LTL mode , in 1 iterations and 2673 ms. Remains : 38/38 places, 56/56 transitions.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 361 steps (27 resets) in 6 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 260 ms.
Product exploration explored 100000 steps with 25000 reset in 288 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-02 18:43:08] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-02 18:43:08] [INFO ] Invariant cache hit.
[2024-06-02 18:43:08] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:43:08] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 56/94 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 56/94 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/94 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
After SMT, in 2059ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2075 ms. Remains : 38/38 places, 56/56 transitions.
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 56/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-02 18:43:10] [INFO ] Invariant cache hit.
[2024-06-02 18:43:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:43:10] [INFO ] Invariant cache hit.
[2024-06-02 18:43:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:43:10] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-02 18:43:10] [INFO ] Invariant cache hit.
[2024-06-02 18:43:10] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:43:11] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 56/94 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 56/94 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/94 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
After SMT, in 2143ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2144ms
Finished structural reductions in LTL mode , in 1 iterations and 2324 ms. Remains : 38/38 places, 56/56 transitions.
Treatment of property MedleyA-PT-06-LTLCardinality-10 finished in 10555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Found a Shortening insensitive property : MedleyA-PT-06-LTLCardinality-12
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 104/104 places, 94/94 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 102 transition count 87
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 96 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 95 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 15 place count 95 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 29 place count 88 transition count 79
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 35 place count 82 transition count 73
Iterating global reduction 3 with 6 rules applied. Total rules applied 41 place count 82 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 41 place count 82 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 80 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 79 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 79 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 with 3 rules applied. Total rules applied 50 place count 78 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 51 place count 77 transition count 68
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 95 place count 55 transition count 46
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 105 place count 50 transition count 54
Applied a total of 105 rules in 18 ms. Remains 50 /104 variables (removed 54) and now considering 54/94 (removed 40) transitions.
// Phase 1: matrix 54 rows 50 cols
[2024-06-02 18:43:13] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 18:43:13] [INFO ] Implicit Places using invariants in 96 ms returned [16, 26, 30, 33, 43]
[2024-06-02 18:43:13] [INFO ] Actually due to overlaps returned [30, 43, 16, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/104 places, 54/94 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 46 transition count 52
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 41 transition count 49
Applied a total of 10 rules in 4 ms. Remains 41 /46 variables (removed 5) and now considering 49/54 (removed 5) transitions.
// Phase 1: matrix 49 rows 41 cols
[2024-06-02 18:43:13] [INFO ] Computed 11 invariants in 0 ms
[2024-06-02 18:43:13] [INFO ] Implicit Places using invariants in 68 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 40/104 places, 49/94 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 55
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 55/49 (removed -6) transitions.
// Phase 1: matrix 55 rows 39 cols
[2024-06-02 18:43:13] [INFO ] Computed 10 invariants in 0 ms
[2024-06-02 18:43:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:43:13] [INFO ] Invariant cache hit.
[2024-06-02 18:43:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:43:13] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 39/104 places, 55/94 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 357 ms. Remains : 39/104 places, 55/94 transitions.
Running random walk in product with property : MedleyA-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 10238 reset in 127 ms.
Stack based approach found an accepted trace after 52857 steps with 5391 reset with depth 21 and stack size 21 in 104 ms.
Treatment of property MedleyA-PT-06-LTLCardinality-12 finished in 971 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-02 18:43:13] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:43:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 18:43:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 94 transitions and 267 arcs took 9 ms.
Total runtime 92542 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-06

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1598
MODEL NAME: /home/mcc/execution/414/model
104 places, 94 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-06-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-06-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717353815238

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-06, 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 r575-smll-171734919500043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-06.tgz
mv MedleyA-PT-06 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 ;