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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 03:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 136K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717237736455

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:28:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:28:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:28:59] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-06-01 10:28:59] [INFO ] Transformed 260 places.
[2024-06-01 10:28:59] [INFO ] Transformed 236 transitions.
[2024-06-01 10:28:59] [INFO ] Parsed PT model containing 260 places and 236 transitions and 721 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 251 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 245 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 245 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 242 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 242 transition count 227
Applied a total of 27 rules in 216 ms. Remains 242 /260 variables (removed 18) and now considering 227/236 (removed 9) transitions.
// Phase 1: matrix 227 rows 242 cols
[2024-06-01 10:29:00] [INFO ] Computed 15 invariants in 75 ms
[2024-06-01 10:29:00] [INFO ] Implicit Places using invariants in 813 ms returned []
[2024-06-01 10:29:00] [INFO ] Invariant cache hit.
[2024-06-01 10:29:01] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-01 10:29:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/233 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 9/242 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 227/469 variables, 242/257 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/469 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 257 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/233 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 9/242 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 227/469 variables, 242/257 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 217/474 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 474 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 48008ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 48052ms
Starting structural reductions in LTL mode, iteration 1 : 242/260 places, 227/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50104 ms. Remains : 242/260 places, 227/236 transitions.
Support contains 47 out of 242 places after structural reductions.
[2024-06-01 10:29:50] [INFO ] Flatten gal took : 81 ms
[2024-06-01 10:29:50] [INFO ] Flatten gal took : 35 ms
[2024-06-01 10:29:50] [INFO ] Input system was already deterministic with 227 transitions.
Support contains 43 out of 242 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (168 resets) in 2681 ms. (14 steps per ms) remains 16/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
[2024-06-01 10:29:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 198/217 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/220 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 5 (OVERLAPS) 227/447 variables, 220/235 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/235 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/469 variables, 22/257 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/257 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/469 variables, 0/257 constraints. Problems are: Problem set: 15 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 257 constraints, problems are : Problem set: 15 solved, 1 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 198/200 variables, 11/11 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/203 variables, 1/12 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/220 variables, 3/15 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 227/447 variables, 220/235 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/235 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/469 variables, 22/257 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 1/258 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 0/258 constraints. Problems are: Problem set: 15 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/469 variables, 0/258 constraints. Problems are: Problem set: 15 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 258 constraints, problems are : Problem set: 15 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 1/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 1036ms problems are : Problem set: 15 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 227/227 transitions.
Graph (complete) has 455 edges and 242 vertex of which 239 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 239 transition count 141
Reduce places removed 84 places and 0 transitions.
Graph (complete) has 274 edges and 155 vertex of which 143 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 143 transition count 140
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 186 place count 142 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 190 place count 138 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 138 transition count 124
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 197 place count 138 transition count 121
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 240 edges and 135 vertex of which 130 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 201 place count 130 transition count 121
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 206 place count 130 transition count 116
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 208 place count 128 transition count 114
Iterating global reduction 6 with 2 rules applied. Total rules applied 210 place count 128 transition count 114
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 211 place count 127 transition count 113
Iterating global reduction 6 with 1 rules applied. Total rules applied 212 place count 127 transition count 113
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 220 place count 127 transition count 105
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 228 place count 119 transition count 105
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 237 place count 110 transition count 96
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 5 rules applied. Total rules applied 242 place count 108 transition count 93
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 245 place count 105 transition count 93
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 245 place count 105 transition count 81
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 269 place count 93 transition count 81
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 9 with 4 rules applied. Total rules applied 273 place count 91 transition count 79
Applied a total of 273 rules in 93 ms. Remains 91 /242 variables (removed 151) and now considering 79/227 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 91/242 places, 79/227 transitions.
RANDOM walk for 8081 steps (97 resets) in 62 ms. (128 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 15 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 242 stabilizing places and 227 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 242 transition count 227
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 233 transition count 135
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 150 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 149 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 174 place count 143 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 143 transition count 128
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 183 place count 143 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 186 place count 140 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 187 place count 139 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 139 transition count 124
Applied a total of 188 rules in 35 ms. Remains 139 /242 variables (removed 103) and now considering 124/227 (removed 103) transitions.
// Phase 1: matrix 124 rows 139 cols
[2024-06-01 10:29:53] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 10:29:53] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 10:29:53] [INFO ] Invariant cache hit.
[2024-06-01 10:29:53] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-06-01 10:29:53] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 10:29:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/239 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/263 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/239 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/263 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7002 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11559ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/242 places, 124/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12157 ms. Remains : 139/242 places, 124/227 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 3680 reset in 608 ms.
Product exploration explored 100000 steps with 3659 reset in 394 ms.
Computed a total of 139 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 139 transition count 124
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 420 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (288 resets) in 432 ms. (92 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (69 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
[2024-06-01 10:30:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/106 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/123 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 110/233 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/239 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/263 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/106 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/123 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 110/233 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/239 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/239 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/263 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 124/124 transitions.
Graph (complete) has 238 edges and 139 vertex of which 124 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 124 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 109
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 17 place count 123 transition count 101
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 33 place count 115 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 114 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 114 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 113 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 113 transition count 99
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 46 place count 113 transition count 90
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 56 place count 103 transition count 90
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 56 place count 103 transition count 83
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 70 place count 96 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 94 transition count 81
Applied a total of 74 rules in 48 ms. Remains 94 /139 variables (removed 45) and now considering 81/124 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 94/139 places, 81/124 transitions.
RANDOM walk for 40000 steps (476 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 180 steps, run visited all 1 properties in 11 ms. (steps per millisecond=16 )
Probabilistic random walk after 180 steps, saw 142 distinct states, run finished after 18 ms. (steps per millisecond=10 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 917 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 124/124 transitions.
Applied a total of 0 rules in 13 ms. Remains 139 /139 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-06-01 10:30:09] [INFO ] Invariant cache hit.
[2024-06-01 10:30:09] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 10:30:09] [INFO ] Invariant cache hit.
[2024-06-01 10:30:09] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-06-01 10:30:09] [INFO ] Redundant transitions in 5 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 10:30:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/239 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/263 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/239 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/263 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10408ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10416ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11006 ms. Remains : 139/139 places, 124/124 transitions.
Computed a total of 139 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 139 transition count 124
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (288 resets) in 140 ms. (283 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (70 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-06-01 10:30:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/106 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/123 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 110/233 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/239 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/263 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/106 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/123 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 110/233 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/239 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/239 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/263 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 124/124 transitions.
Graph (complete) has 238 edges and 139 vertex of which 124 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 124 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 109
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 17 place count 123 transition count 101
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 33 place count 115 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 114 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 114 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 113 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 113 transition count 99
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 46 place count 113 transition count 90
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 56 place count 103 transition count 90
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 56 place count 103 transition count 83
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 70 place count 96 transition count 83
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 3 with 4 rules applied. Total rules applied 74 place count 94 transition count 81
Applied a total of 74 rules in 31 ms. Remains 94 /139 variables (removed 45) and now considering 81/124 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 94/139 places, 81/124 transitions.
RANDOM walk for 40000 steps (476 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (176 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 180 steps, run visited all 1 properties in 6 ms. (steps per millisecond=30 )
Probabilistic random walk after 180 steps, saw 142 distinct states, run finished after 6 ms. (steps per millisecond=30 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 793 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3692 reset in 366 ms.
Product exploration explored 100000 steps with 3635 reset in 435 ms.
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 124/124 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-06-01 10:30:22] [INFO ] Invariant cache hit.
[2024-06-01 10:30:22] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 10:30:22] [INFO ] Invariant cache hit.
[2024-06-01 10:30:23] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-06-01 10:30:23] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 10:30:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/239 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/263 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/239 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/263 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 127/139 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11009ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11010ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11528 ms. Remains : 139/139 places, 124/124 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-00 finished in 41145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 235 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 232 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 232 transition count 218
Applied a total of 19 rules in 19 ms. Remains 232 /242 variables (removed 10) and now considering 218/227 (removed 9) transitions.
// Phase 1: matrix 218 rows 232 cols
[2024-06-01 10:30:34] [INFO ] Computed 14 invariants in 9 ms
[2024-06-01 10:30:34] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 10:30:34] [INFO ] Invariant cache hit.
[2024-06-01 10:30:35] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 10:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13635 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 43763ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 43767ms
Starting structural reductions in LTL mode, iteration 1 : 232/242 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44476 ms. Remains : 232/242 places, 218/227 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-05
Product exploration explored 100000 steps with 32946 reset in 320 ms.
Product exploration explored 100000 steps with 32947 reset in 323 ms.
Computed a total of 232 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 218
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 239 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-06-01 10:31:20] [INFO ] Invariant cache hit.
[2024-06-01 10:31:20] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 10:31:20] [INFO ] Invariant cache hit.
[2024-06-01 10:31:21] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 10:31:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13488 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 43611ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 43615ms
Finished structural reductions in LTL mode , in 1 iterations and 44651 ms. Remains : 232/232 places, 218/218 transitions.
Computed a total of 232 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 218
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 66 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33088 reset in 299 ms.
Product exploration explored 100000 steps with 33144 reset in 326 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 218/218 transitions.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 232 transition count 218
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 86 rules in 59 ms. Remains 232 /232 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-06-01 10:32:07] [INFO ] Redundant transitions in 15 ms returned []
Running 208 sub problems to find dead transitions.
// Phase 1: matrix 218 rows 232 cols
[2024-06-01 10:32:07] [INFO ] Computed 14 invariants in 4 ms
[2024-06-01 10:32:07] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 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 TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 86/332 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/332 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/450 variables, 0/332 constraints. Problems are: Problem set: 86 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 332 constraints, problems are : Problem set: 86 solved, 122 unsolved in 13741 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 86 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 96/232 variables, 14/14 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 86/332 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 122/454 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/454 constraints. Problems are: Problem set: 86 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/450 variables, 0/454 constraints. Problems are: Problem set: 86 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 86 solved, 122 unsolved in 14071 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 122/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 27888ms problems are : Problem set: 86 solved, 122 unsolved
Search for dead transitions found 86 dead transitions in 27893ms
Found 86 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 86 transitions
Dead transitions reduction (with SMT) removed 86 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 232/232 places, 132/218 transitions.
Graph (complete) has 357 edges and 232 vertex of which 146 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.1 ms
Discarding 86 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 146 /232 variables (removed 86) and now considering 132/132 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 146/232 places, 132/218 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27997 ms. Remains : 146/232 places, 132/218 transitions.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 232 cols
[2024-06-01 10:32:35] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 10:32:35] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-06-01 10:32:35] [INFO ] Invariant cache hit.
[2024-06-01 10:32:36] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 10:32:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 15965 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 46064ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 46068ms
Finished structural reductions in LTL mode , in 1 iterations and 47013 ms. Remains : 232/232 places, 218/218 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-05 finished in 168176 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(F(p0))))'
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 227
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 234 transition count 220
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 234 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 230 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 230 transition count 216
Applied a total of 23 rules in 21 ms. Remains 230 /242 variables (removed 12) and now considering 216/227 (removed 11) transitions.
// Phase 1: matrix 216 rows 230 cols
[2024-06-01 10:33:22] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 10:33:22] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 10:33:22] [INFO ] Invariant cache hit.
[2024-06-01 10:33:23] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-06-01 10:33:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 10442 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 40508ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 40511ms
Starting structural reductions in LTL mode, iteration 1 : 230/242 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41158 ms. Remains : 230/242 places, 216/227 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 25432 reset in 303 ms.
Product exploration explored 100000 steps with 25344 reset in 328 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 10:34:05] [INFO ] Invariant cache hit.
[2024-06-01 10:34:05] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 10:34:05] [INFO ] Invariant cache hit.
[2024-06-01 10:34:06] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-06-01 10:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15277 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 45380ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 45384ms
Finished structural reductions in LTL mode , in 1 iterations and 46232 ms. Remains : 230/230 places, 216/216 transitions.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 131 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25277 reset in 321 ms.
Product exploration explored 100000 steps with 25264 reset in 302 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 230 transition count 216
Deduced a syphon composed of 77 places in 1 ms
Applied a total of 77 rules in 19 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 10:34:53] [INFO ] Redundant transitions in 3 ms returned []
Running 206 sub problems to find dead transitions.
// Phase 1: matrix 216 rows 230 cols
[2024-06-01 10:34:53] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 10:34:53] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 77/321 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/321 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/446 variables, 0/321 constraints. Problems are: Problem set: 77 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 321 constraints, problems are : Problem set: 77 solved, 129 unsolved in 9624 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 77 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 87/230 variables, 14/14 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 77/321 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 129/450 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 77 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/446 variables, 0/450 constraints. Problems are: Problem set: 77 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 77 solved, 129 unsolved in 11855 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 129/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 21577ms problems are : Problem set: 77 solved, 129 unsolved
Search for dead transitions found 77 dead transitions in 21580ms
Found 77 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 77 transitions
Dead transitions reduction (with SMT) removed 77 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 230/230 places, 139/216 transitions.
Graph (complete) has 363 edges and 230 vertex of which 153 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.2 ms
Discarding 77 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 153 /230 variables (removed 77) and now considering 139/139 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 153/230 places, 139/216 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21627 ms. Remains : 153/230 places, 139/216 transitions.
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 230 cols
[2024-06-01 10:35:14] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 10:35:15] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 10:35:15] [INFO ] Invariant cache hit.
[2024-06-01 10:35:15] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-06-01 10:35:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 11863 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 41947ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 41951ms
Finished structural reductions in LTL mode , in 1 iterations and 42792 ms. Remains : 230/230 places, 216/216 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-06 finished in 155143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&(G(F(p2))||(F(p2)&&F(p0))))))'
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 235 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 232 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 232 transition count 218
Applied a total of 19 rules in 15 ms. Remains 232 /242 variables (removed 10) and now considering 218/227 (removed 9) transitions.
// Phase 1: matrix 218 rows 232 cols
[2024-06-01 10:35:57] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 10:35:57] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-01 10:35:57] [INFO ] Invariant cache hit.
[2024-06-01 10:35:58] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 10:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 14683 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 44786ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 44790ms
Starting structural reductions in LTL mode, iteration 1 : 232/242 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45822 ms. Remains : 232/242 places, 218/227 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-09 finished in 46095 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(G(p0)))'
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 227
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 234 transition count 220
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 234 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 230 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 230 transition count 216
Applied a total of 23 rules in 16 ms. Remains 230 /242 variables (removed 12) and now considering 216/227 (removed 11) transitions.
// Phase 1: matrix 216 rows 230 cols
[2024-06-01 10:36:43] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 10:36:43] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 10:36:43] [INFO ] Invariant cache hit.
[2024-06-01 10:36:44] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-06-01 10:36:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 14251 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 44319ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 44322ms
Starting structural reductions in LTL mode, iteration 1 : 230/242 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44997 ms. Remains : 230/242 places, 216/227 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-10 finished in 45140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Graph (complete) has 455 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 232 transition count 124
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 189 place count 138 transition count 124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 133 transition count 119
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 133 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 201 place count 133 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 131 transition count 117
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 4 with 2 rules applied. Total rules applied 205 place count 130 transition count 116
Applied a total of 205 rules in 31 ms. Remains 130 /242 variables (removed 112) and now considering 116/227 (removed 111) transitions.
// Phase 1: matrix 116 rows 130 cols
[2024-06-01 10:37:28] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 10:37:29] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 10:37:29] [INFO ] Invariant cache hit.
[2024-06-01 10:37:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:37:29] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-01 10:37:29] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 10:37:29] [INFO ] Invariant cache hit.
[2024-06-01 10:37:29] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 3/116 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 103/219 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/220 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/246 variables, and 141 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6649 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 117/130 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 3/116 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 103/219 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 99/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/246 variables, and 240 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6253 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 117/130 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 12914ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 12917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/242 places, 116/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13492 ms. Remains : 130/242 places, 116/227 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 2516 reset in 347 ms.
Product exploration explored 100000 steps with 2521 reset in 314 ms.
Computed a total of 130 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 130 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 475 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (312 resets) in 94 ms. (421 steps per ms) remains 1/4 properties
BEST_FIRST walk for 2347 steps (0 resets) in 5 ms. (391 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 730 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 10:37:44] [INFO ] Invariant cache hit.
[2024-06-01 10:37:44] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 10:37:44] [INFO ] Invariant cache hit.
[2024-06-01 10:37:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:37:45] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-06-01 10:37:45] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 10:37:45] [INFO ] Invariant cache hit.
[2024-06-01 10:37:45] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 3/116 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 103/219 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/220 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/246 variables, and 141 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4869 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 117/130 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 3/116 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 103/219 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 99/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/246 variables, and 240 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7301 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 117/130 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 12187ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 12189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12695 ms. Remains : 130/130 places, 116/116 transitions.
Computed a total of 130 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 130 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 706 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40001 steps (312 resets) in 114 ms. (347 steps per ms) remains 1/4 properties
BEST_FIRST walk for 2124 steps (0 resets) in 6 ms. (303 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 1098 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2413 reset in 299 ms.
Product exploration explored 100000 steps with 2433 reset in 564 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 10:38:00] [INFO ] Invariant cache hit.
[2024-06-01 10:38:00] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 10:38:00] [INFO ] Invariant cache hit.
[2024-06-01 10:38:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:38:01] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-01 10:38:01] [INFO ] Redundant transitions in 0 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 10:38:01] [INFO ] Invariant cache hit.
[2024-06-01 10:38:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 3/116 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 103/219 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/220 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/246 variables, and 141 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6479 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 117/130 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 3/116 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 103/219 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 99/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/246 variables, and 240 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7006 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 117/130 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 13516ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 13518ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14056 ms. Remains : 130/130 places, 116/116 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-14 finished in 45864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Graph (complete) has 455 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 231 transition count 122
Reduce places removed 95 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 136 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 135 transition count 121
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 200 place count 128 transition count 114
Iterating global reduction 3 with 7 rules applied. Total rules applied 207 place count 128 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 210 place count 128 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 213 place count 125 transition count 111
Applied a total of 213 rules in 15 ms. Remains 125 /242 variables (removed 117) and now considering 111/227 (removed 116) transitions.
// Phase 1: matrix 111 rows 125 cols
[2024-06-01 10:38:14] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 10:38:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 10:38:14] [INFO ] Invariant cache hit.
[2024-06-01 10:38:15] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-06-01 10:38:15] [INFO ] Redundant transitions in 0 ms returned []
Running 92 sub problems to find dead transitions.
[2024-06-01 10:38:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/236 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3736 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/236 variables, and 214 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3375 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 7121ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 7122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/242 places, 111/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7507 ms. Remains : 125/242 places, 111/227 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-15
Product exploration explored 100000 steps with 1415 reset in 226 ms.
Product exploration explored 100000 steps with 1402 reset in 255 ms.
Computed a total of 125 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 125 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 165 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 111/111 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-06-01 10:38:23] [INFO ] Invariant cache hit.
[2024-06-01 10:38:23] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-01 10:38:23] [INFO ] Invariant cache hit.
[2024-06-01 10:38:24] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2024-06-01 10:38:24] [INFO ] Redundant transitions in 1 ms returned []
Running 92 sub problems to find dead transitions.
[2024-06-01 10:38:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/236 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3708 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/236 variables, and 214 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2447 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 6168ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 6170ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6795 ms. Remains : 125/125 places, 111/111 transitions.
Computed a total of 125 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 125 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 161 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1433 reset in 224 ms.
Product exploration explored 100000 steps with 1487 reset in 259 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-06-01 10:38:31] [INFO ] Invariant cache hit.
[2024-06-01 10:38:31] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-01 10:38:31] [INFO ] Invariant cache hit.
[2024-06-01 10:38:32] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-06-01 10:38:32] [INFO ] Redundant transitions in 0 ms returned []
Running 92 sub problems to find dead transitions.
[2024-06-01 10:38:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/236 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2577 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/236 variables, and 214 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3016 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 5607ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5609ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6219 ms. Remains : 125/125 places, 111/111 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-15 finished in 23001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
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)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-10-LTLCardinality-05
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Graph (complete) has 455 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 232 transition count 131
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 145 transition count 131
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 139 transition count 125
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 139 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 189 place count 139 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 137 transition count 123
Applied a total of 191 rules in 15 ms. Remains 137 /242 variables (removed 105) and now considering 123/227 (removed 104) transitions.
// Phase 1: matrix 123 rows 137 cols
[2024-06-01 10:38:38] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 10:38:38] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 10:38:38] [INFO ] Invariant cache hit.
[2024-06-01 10:38:38] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 10:38:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 4/236 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5394 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 4/236 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 12/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/260 variables, and 245 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5085 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 10494ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 10498ms
Starting structural reductions in LI_LTL mode, iteration 1 : 137/242 places, 123/227 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11093 ms. Remains : 137/242 places, 123/227 transitions.
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-05
Product exploration explored 100000 steps with 43414 reset in 325 ms.
Product exploration explored 100000 steps with 43310 reset in 317 ms.
Computed a total of 137 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 41 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 10:38:50] [INFO ] Invariant cache hit.
[2024-06-01 10:38:50] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 10:38:50] [INFO ] Invariant cache hit.
[2024-06-01 10:38:51] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 10:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 4/236 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4110 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 4/236 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 12/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/260 variables, and 245 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4443 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 8568ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 8570ms
Finished structural reductions in LTL mode , in 1 iterations and 9145 ms. Remains : 137/137 places, 123/123 transitions.
Computed a total of 137 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 43243 reset in 184 ms.
Product exploration explored 100000 steps with 43099 reset in 227 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 123/123 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 10:39:01] [INFO ] Redundant transitions in 0 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 10:39:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 4/236 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5064 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 4/236 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 12/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/260 variables, and 245 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5690 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 10776ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 10779ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10802 ms. Remains : 137/137 places, 123/123 transitions.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 10:39:12] [INFO ] Invariant cache hit.
[2024-06-01 10:39:12] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 10:39:12] [INFO ] Invariant cache hit.
[2024-06-01 10:39:12] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 10:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 4/236 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5803 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/232 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 4/236 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 12/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/260 variables, and 245 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6430 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 12259ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 12261ms
Finished structural reductions in LTL mode , in 1 iterations and 12767 ms. Remains : 137/137 places, 123/123 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-05 finished in 46848 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(F(p0))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-10-LTLCardinality-06
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 242/242 places, 227/227 transitions.
Graph (complete) has 455 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 8 places and 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 233 transition count 141
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 155 transition count 141
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 148 transition count 134
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 148 transition count 134
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 173 place count 148 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 175 place count 146 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 145 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 145 transition count 131
Applied a total of 177 rules in 25 ms. Remains 145 /242 variables (removed 97) and now considering 131/227 (removed 96) transitions.
// Phase 1: matrix 131 rows 145 cols
[2024-06-01 10:39:25] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 10:39:25] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 10:39:25] [INFO ] Invariant cache hit.
[2024-06-01 10:39:25] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-01 10:39:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/276 variables, and 150 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5990 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 118/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/276 variables, and 268 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6706 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 12724ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 12727ms
Starting structural reductions in LI_LTL mode, iteration 1 : 145/242 places, 131/227 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13330 ms. Remains : 145/242 places, 131/227 transitions.
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 28067 reset in 181 ms.
Product exploration explored 100000 steps with 27922 reset in 201 ms.
Computed a total of 145 stabilizing places and 131 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 145 transition count 131
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 78 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 10:39:39] [INFO ] Invariant cache hit.
[2024-06-01 10:39:39] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 10:39:39] [INFO ] Invariant cache hit.
[2024-06-01 10:39:40] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-01 10:39:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/276 variables, and 150 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5049 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 118/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/276 variables, and 268 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5661 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 10732ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 10734ms
Finished structural reductions in LTL mode , in 1 iterations and 11379 ms. Remains : 145/145 places, 131/131 transitions.
Computed a total of 145 stabilizing places and 131 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 145 transition count 131
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28015 reset in 182 ms.
Product exploration explored 100000 steps with 28011 reset in 208 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 131/131 transitions.
Applied a total of 0 rules in 9 ms. Remains 145 /145 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 10:39:52] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 10:39:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/276 variables, and 150 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4534 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 118/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/276 variables, and 268 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5180 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 9734ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 9736ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9763 ms. Remains : 145/145 places, 131/131 transitions.
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 10:40:02] [INFO ] Invariant cache hit.
[2024-06-01 10:40:02] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 10:40:02] [INFO ] Invariant cache hit.
[2024-06-01 10:40:02] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-01 10:40:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/276 variables, and 150 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4370 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/150 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 118/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/276 variables, and 268 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4964 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 136/145 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 9356ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 9358ms
Finished structural reductions in LTL mode , in 1 iterations and 9779 ms. Remains : 145/145 places, 131/131 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-06 finished in 47269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
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)))'
[2024-06-01 10:40:12] [INFO ] Flatten gal took : 19 ms
[2024-06-01 10:40:12] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 10:40:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 242 places, 227 transitions and 682 arcs took 5 ms.
Total runtime 673511 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : HirschbergSinclair-PT-10-LTLCardinality-00
Could not compute solution for formula : HirschbergSinclair-PT-10-LTLCardinality-05
Could not compute solution for formula : HirschbergSinclair-PT-10-LTLCardinality-06
FORMULA HirschbergSinclair-PT-10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : HirschbergSinclair-PT-10-LTLCardinality-15

BK_STOP 1717238699850

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name HirschbergSinclair-PT-10-LTLCardinality-00
ltl formula formula --ltl=/tmp/2015/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 242 places, 227 transitions and 682 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2015/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2015/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2015/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2015/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 242 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 243, there are 231 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~137 levels ~10000 states ~22172 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~20000 states ~43796 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~40000 states ~85692 transitions
pnml2lts-mc( 1/ 4): ~235 levels ~80000 states ~178436 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~160000 states ~388860 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~320000 states ~801584 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~640000 states ~1670952 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~1280000 states ~3861532 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~2560000 states ~8491180 transitions
pnml2lts-mc( 3/ 4): ~137 levels ~5120000 states ~15223792 transitions
pnml2lts-mc( 3/ 4): ~137 levels ~10240000 states ~32014328 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13564393
pnml2lts-mc( 0/ 4): unique states count: 13564753
pnml2lts-mc( 0/ 4): unique transitions count: 50187256
pnml2lts-mc( 0/ 4): - self-loop count: 3920
pnml2lts-mc( 0/ 4): - claim dead count: 36617264
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13565013
pnml2lts-mc( 0/ 4): - cum. max stack depth: 739
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13565013 states 50188368 transitions, fanout: 3.700
pnml2lts-mc( 0/ 4): Total exploration time 69.180 sec (69.150 sec minimum, 69.173 sec on average)
pnml2lts-mc( 0/ 4): States per second: 196083, Transitions per second: 725475
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 167.5MB, 12.9 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 40.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 227 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 167.5MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-10-LTLCardinality-05
ltl formula formula --ltl=/tmp/2015/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 242 places, 227 transitions and 682 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2015/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2015/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2015/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2015/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 243 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 243, there are 229 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~62 levels ~10000 states ~14800 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~20000 states ~29596 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~40000 states ~60796 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~80000 states ~123952 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~160000 states ~258300 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~320000 states ~523952 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~640000 states ~1095812 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~1280000 states ~2300440 transitions
pnml2lts-mc( 1/ 4): ~61 levels ~2560000 states ~5119820 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4080204
pnml2lts-mc( 0/ 4): unique states count: 4080381
pnml2lts-mc( 0/ 4): unique transitions count: 8398110
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4316701
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4080398
pnml2lts-mc( 0/ 4): - cum. max stack depth: 245
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4080398 states 8398188 transitions, fanout: 2.058
pnml2lts-mc( 0/ 4): Total exploration time 20.030 sec (20.000 sec minimum, 20.013 sec on average)
pnml2lts-mc( 0/ 4): States per second: 203714, Transitions per second: 419280
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 95.1MB, 24.4 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 227 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 95.1MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-10-LTLCardinality-06
ltl formula formula --ltl=/tmp/2015/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 242 places, 227 transitions and 682 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2015/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2015/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2015/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2015/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 243 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 243, there are 230 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~61 levels ~10000 states ~15104 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~20000 states ~30288 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~40000 states ~67768 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~80000 states ~143664 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~160000 states ~298168 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~320000 states ~612288 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~640000 states ~1235740 transitions
pnml2lts-mc( 1/ 4): ~61 levels ~1280000 states ~2517436 transitions
pnml2lts-mc( 1/ 4): ~61 levels ~2560000 states ~5209912 transitions
pnml2lts-mc( 1/ 4): ~61 levels ~5120000 states ~10783392 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5688598
pnml2lts-mc( 0/ 4): unique states count: 5688758
pnml2lts-mc( 0/ 4): unique transitions count: 12461320
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6771722
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5688785
pnml2lts-mc( 0/ 4): - cum. max stack depth: 245
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5688785 states 12461462 transitions, fanout: 2.191
pnml2lts-mc( 0/ 4): Total exploration time 27.760 sec (27.670 sec minimum, 27.708 sec on average)
pnml2lts-mc( 0/ 4): States per second: 204927, Transitions per second: 448900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 107.4MB, 19.8 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 227 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 107.4MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-10-LTLCardinality-14
ltl formula formula --ltl=/tmp/2015/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 242 places, 227 transitions and 682 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2015/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2015/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2015/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2015/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 242 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 243, there are 237 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~219!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 386
pnml2lts-mc( 0/ 4): unique states count: 1181
pnml2lts-mc( 0/ 4): unique transitions count: 4363
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1192
pnml2lts-mc( 0/ 4): - cum. max stack depth: 806
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1192 states 4454 transitions, fanout: 3.737
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 39733, Transitions per second: 148467
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 27.9 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 227 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-10-LTLCardinality-15
ltl formula formula --ltl=/tmp/2015/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 242 places, 227 transitions and 682 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2015/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2015/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2015/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2015/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 243 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 243, there are 230 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~235 levels ~10000 states ~24868 transitions
pnml2lts-mc( 1/ 4): ~235 levels ~20000 states ~53088 transitions
pnml2lts-mc( 1/ 4): ~235 levels ~40000 states ~111652 transitions
pnml2lts-mc( 1/ 4): ~235 levels ~80000 states ~243176 transitions
pnml2lts-mc( 1/ 4): ~235 levels ~160000 states ~520924 transitions
pnml2lts-mc( 1/ 4): ~235 levels ~320000 states ~1192432 transitions
pnml2lts-mc( 1/ 4): ~235 levels ~640000 states ~2517676 transitions
pnml2lts-mc( 2/ 4): ~237 levels ~1280000 states ~5211084 transitions
pnml2lts-mc( 2/ 4): ~237 levels ~2560000 states ~11439572 transitions
pnml2lts-mc( 2/ 4): ~237 levels ~5120000 states ~24863624 transitions
pnml2lts-mc( 2/ 4): ~237 levels ~10240000 states ~51384944 transitions
pnml2lts-mc( 2/ 4): ~237 levels ~20480000 states ~109176640 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30243319
pnml2lts-mc( 0/ 4): unique states count: 30243685
pnml2lts-mc( 0/ 4): unique transitions count: 172126734
pnml2lts-mc( 0/ 4): - self-loop count: 22160
pnml2lts-mc( 0/ 4): - claim dead count: 141859679
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 30244503
pnml2lts-mc( 0/ 4): - cum. max stack depth: 942
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30244503 states 172128317 transitions, fanout: 5.691
pnml2lts-mc( 0/ 4): Total exploration time 167.840 sec (167.830 sec minimum, 167.837 sec on average)
pnml2lts-mc( 0/ 4): States per second: 180198, Transitions per second: 1025550
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 294.8MB, 10.2 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 90.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 227 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 294.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-10, 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 r500-smll-171649587400067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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