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.r464-smll-171620118300340.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 Anderson-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118300340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K 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 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 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 461K 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 Anderson-PT-07-LTLFireability-00
FORMULA_NAME Anderson-PT-07-LTLFireability-01
FORMULA_NAME Anderson-PT-07-LTLFireability-02
FORMULA_NAME Anderson-PT-07-LTLFireability-03
FORMULA_NAME Anderson-PT-07-LTLFireability-04
FORMULA_NAME Anderson-PT-07-LTLFireability-05
FORMULA_NAME Anderson-PT-07-LTLFireability-06
FORMULA_NAME Anderson-PT-07-LTLFireability-07
FORMULA_NAME Anderson-PT-07-LTLFireability-08
FORMULA_NAME Anderson-PT-07-LTLFireability-09
FORMULA_NAME Anderson-PT-07-LTLFireability-10
FORMULA_NAME Anderson-PT-07-LTLFireability-11
FORMULA_NAME Anderson-PT-07-LTLFireability-12
FORMULA_NAME Anderson-PT-07-LTLFireability-13
FORMULA_NAME Anderson-PT-07-LTLFireability-14
FORMULA_NAME Anderson-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717255997985

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:33:21] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2024-06-01 15:33:21] [INFO ] Transformed 309 places.
[2024-06-01 15:33:21] [INFO ] Transformed 917 transitions.
[2024-06-01 15:33:21] [INFO ] Found NUPN structural information;
[2024-06-01 15:33:21] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 599 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Anderson-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 237 transition count 461
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 237 transition count 461
Applied a total of 144 rules in 162 ms. Remains 237 /309 variables (removed 72) and now considering 461/917 (removed 456) transitions.
// Phase 1: matrix 461 rows 237 cols
[2024-06-01 15:33:21] [INFO ] Computed 17 invariants in 60 ms
[2024-06-01 15:33:22] [INFO ] Implicit Places using invariants in 1002 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/309 places, 461/917 transitions.
Applied a total of 0 rules in 16 ms. Remains 236 /236 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1287 ms. Remains : 236/309 places, 461/917 transitions.
Support contains 23 out of 236 places after structural reductions.
[2024-06-01 15:33:23] [INFO ] Flatten gal took : 147 ms
[2024-06-01 15:33:23] [INFO ] Flatten gal took : 78 ms
[2024-06-01 15:33:23] [INFO ] Input system was already deterministic with 461 transitions.
RANDOM walk for 40000 steps (8 resets) in 2268 ms. (17 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
// Phase 1: matrix 461 rows 236 cols
[2024-06-01 15:33:24] [INFO ] Computed 16 invariants in 8 ms
[2024-06-01 15:33:24] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 117/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/236 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 461/697 variables, 236/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/697 variables, 42/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 294 constraints, problems are : Problem set: 0 solved, 3 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 236/236 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 117/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/236 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:33:25] [INFO ] Deduced a trap composed of 153 places in 283 ms of which 41 ms to minimize.
[2024-06-01 15:33:26] [INFO ] Deduced a trap composed of 71 places in 245 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 461/697 variables, 236/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 42/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/697 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/697 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/697 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 697/697 variables, and 299 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 236/236 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 2504ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 510 ms.
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 236 transition count 415
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 190 transition count 415
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 92 place count 190 transition count 373
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 176 place count 148 transition count 373
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 139 transition count 280
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 139 transition count 280
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 197 place count 139 transition count 277
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 200 place count 136 transition count 277
Applied a total of 200 rules in 66 ms. Remains 136 /236 variables (removed 100) and now considering 277/461 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 136/236 places, 277/461 transitions.
RANDOM walk for 40000 steps (8 resets) in 401 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/2 properties
// Phase 1: matrix 277 rows 136 cols
[2024-06-01 15:33:28] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 15:33:28] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 114/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/122 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 277/413 variables, 136/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 42/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/413 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 114/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/122 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:33:28] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 277/413 variables, 136/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 42/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/413 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 134 transition count 251
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 134 transition count 251
Applied a total of 4 rules in 21 ms. Remains 134 /136 variables (removed 2) and now considering 251/277 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 134/136 places, 251/277 transitions.
RANDOM walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 24784 steps, run visited all 1 properties in 127 ms. (steps per millisecond=195 )
Probabilistic random walk after 24784 steps, saw 16505 distinct states, run finished after 134 ms. (steps per millisecond=184 ) properties seen :1
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 224 transition count 329
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 224 transition count 329
Applied a total of 24 rules in 16 ms. Remains 224 /236 variables (removed 12) and now considering 329/461 (removed 132) transitions.
// Phase 1: matrix 329 rows 224 cols
[2024-06-01 15:33:29] [INFO ] Computed 16 invariants in 10 ms
[2024-06-01 15:33:29] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 15:33:29] [INFO ] Invariant cache hit.
[2024-06-01 15:33:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:33:30] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-01 15:33:30] [INFO ] Invariant cache hit.
[2024-06-01 15:33:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 69 places in 280 ms of which 4 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 16 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:33:37] [INFO ] Deduced a trap composed of 113 places in 212 ms of which 4 ms to minimize.
[2024-06-01 15:33:37] [INFO ] Deduced a trap composed of 129 places in 201 ms of which 4 ms to minimize.
[2024-06-01 15:33:37] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:33:37] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 86 places in 286 ms of which 4 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 99 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 143 places in 207 ms of which 4 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 151 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 82 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 96 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:40] [INFO ] Deduced a trap composed of 91 places in 248 ms of which 5 ms to minimize.
[2024-06-01 15:33:40] [INFO ] Deduced a trap composed of 95 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:33:40] [INFO ] Deduced a trap composed of 89 places in 239 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-01 15:33:42] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 5 ms to minimize.
[2024-06-01 15:33:50] [INFO ] Deduced a trap composed of 97 places in 268 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 1/224 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 224/553 variables, and 38 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/224 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 3 ms to minimize.
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/553 variables, and 40 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/224 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/322 constraints, Known Traps: 25/25 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in LTL mode, iteration 1 : 224/236 places, 329/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61442 ms. Remains : 224/236 places, 329/461 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-01
Product exploration explored 100000 steps with 50 reset in 522 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-01 finished in 62426 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((X(p0)&&G(p1)))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 227 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 227 transition count 356
Applied a total of 18 rules in 10 ms. Remains 227 /236 variables (removed 9) and now considering 356/461 (removed 105) transitions.
// Phase 1: matrix 356 rows 227 cols
[2024-06-01 15:34:31] [INFO ] Computed 16 invariants in 6 ms
[2024-06-01 15:34:32] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-06-01 15:34:32] [INFO ] Invariant cache hit.
[2024-06-01 15:34:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:34:32] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-01 15:34:33] [INFO ] Invariant cache hit.
[2024-06-01 15:34:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:34:35] [INFO ] Deduced a trap composed of 112 places in 242 ms of which 4 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 128 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 144 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 113 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 141 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 140 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 84 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 86 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 93 places in 264 ms of which 4 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 100 places in 193 ms of which 4 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 58 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 57 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 57 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 57 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:34:44] [INFO ] Deduced a trap composed of 129 places in 261 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:34:45] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 4 ms to minimize.
[2024-06-01 15:34:45] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 103 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 101 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 125 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 148 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 141 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 81 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 99 places in 261 ms of which 5 ms to minimize.
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:34:51] [INFO ] Deduced a trap composed of 117 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:34:51] [INFO ] Deduced a trap composed of 142 places in 261 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:34:56] [INFO ] Deduced a trap composed of 96 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:34:56] [INFO ] Deduced a trap composed of 122 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:34:57] [INFO ] Deduced a trap composed of 109 places in 223 ms of which 4 ms to minimize.
[2024-06-01 15:34:57] [INFO ] Deduced a trap composed of 133 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:34:57] [INFO ] Deduced a trap composed of 142 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:34:58] [INFO ] Deduced a trap composed of 135 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:34:58] [INFO ] Deduced a trap composed of 104 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:34:58] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:34:58] [INFO ] Deduced a trap composed of 142 places in 245 ms of which 3 ms to minimize.
[2024-06-01 15:34:58] [INFO ] Deduced a trap composed of 141 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:34:59] [INFO ] Deduced a trap composed of 104 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:34:59] [INFO ] Deduced a trap composed of 136 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:34:59] [INFO ] Deduced a trap composed of 87 places in 262 ms of which 5 ms to minimize.
[2024-06-01 15:35:00] [INFO ] Deduced a trap composed of 137 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:35:01] [INFO ] Deduced a trap composed of 137 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:35:01] [INFO ] Deduced a trap composed of 101 places in 277 ms of which 4 ms to minimize.
[2024-06-01 15:35:01] [INFO ] Deduced a trap composed of 90 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:35:02] [INFO ] Deduced a trap composed of 92 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:35:02] [INFO ] Deduced a trap composed of 119 places in 264 ms of which 5 ms to minimize.
[2024-06-01 15:35:02] [INFO ] Deduced a trap composed of 88 places in 259 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/583 variables, and 69 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/227 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 104 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:35:05] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:35:06] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:35:06] [INFO ] Deduced a trap composed of 148 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:35:07] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:35:07] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:35:07] [INFO ] Deduced a trap composed of 76 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:35:08] [INFO ] Deduced a trap composed of 133 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:35:08] [INFO ] Deduced a trap composed of 116 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:35:08] [INFO ] Deduced a trap composed of 122 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:35:08] [INFO ] Deduced a trap composed of 130 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:35:09] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 4 ms to minimize.
[2024-06-01 15:35:09] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:35:09] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:35:09] [INFO ] Deduced a trap composed of 108 places in 217 ms of which 4 ms to minimize.
[2024-06-01 15:35:10] [INFO ] Deduced a trap composed of 73 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:35:10] [INFO ] Deduced a trap composed of 82 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:35:10] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:35:10] [INFO ] Deduced a trap composed of 103 places in 261 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/583 variables, and 89 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/227 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/349 constraints, Known Traps: 73/73 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Starting structural reductions in LTL mode, iteration 1 : 227/236 places, 356/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61629 ms. Remains : 227/236 places, 356/461 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 257 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-02 finished in 62111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(p1))||(G(p2)&&F(p0))))))'
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 343
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 343
Applied a total of 20 rules in 10 ms. Remains 226 /236 variables (removed 10) and now considering 343/461 (removed 118) transitions.
// Phase 1: matrix 343 rows 226 cols
[2024-06-01 15:35:33] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 15:35:34] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 15:35:34] [INFO ] Invariant cache hit.
[2024-06-01 15:35:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:35:35] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-01 15:35:35] [INFO ] Invariant cache hit.
[2024-06-01 15:35:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 80 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:35:40] [INFO ] Deduced a trap composed of 71 places in 268 ms of which 6 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 99 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 121 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 97 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 147 places in 247 ms of which 4 ms to minimize.
[2024-06-01 15:35:44] [INFO ] Deduced a trap composed of 91 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:35:44] [INFO ] Deduced a trap composed of 74 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:35:44] [INFO ] Deduced a trap composed of 113 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:35:44] [INFO ] Deduced a trap composed of 96 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:35:45] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:35:45] [INFO ] Deduced a trap composed of 97 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:35:45] [INFO ] Deduced a trap composed of 74 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:35:45] [INFO ] Deduced a trap composed of 97 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:35:46] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 4 ms to minimize.
[2024-06-01 15:35:46] [INFO ] Deduced a trap composed of 110 places in 263 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 78 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 91 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:35:49] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:35:49] [INFO ] Deduced a trap composed of 110 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:35:49] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:35:49] [INFO ] Deduced a trap composed of 132 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:35:50] [INFO ] Deduced a trap composed of 120 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 79 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 128 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:35:57] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:35:58] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:35:58] [INFO ] Deduced a trap composed of 152 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:35:58] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:35:59] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:36:01] [INFO ] Deduced a trap composed of 99 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:36:01] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 4 ms to minimize.
[2024-06-01 15:36:01] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:36:02] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:36:02] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:36:02] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:36:02] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:36:02] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:36:03] [INFO ] Deduced a trap composed of 98 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:36:03] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:36:03] [INFO ] Deduced a trap composed of 101 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:36:04] [INFO ] Deduced a trap composed of 122 places in 262 ms of which 5 ms to minimize.
[2024-06-01 15:36:04] [INFO ] Deduced a trap composed of 108 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:36:04] [INFO ] Deduced a trap composed of 96 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:36:05] [INFO ] Deduced a trap composed of 121 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:36:05] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:36:05] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 4 ms to minimize.
[2024-06-01 15:36:05] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:36:05] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 4 ms to minimize.
SMT process timed out in 30360ms, After SMT, problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 30368ms
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 343/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31981 ms. Remains : 226/236 places, 343/461 transitions.
Stuttering acceptance computed with spot in 587 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 386 ms.
Product exploration explored 100000 steps with 20000 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 4539 steps (0 resets) in 24 ms. (181 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 226 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 226 /226 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 15:36:08] [INFO ] Invariant cache hit.
[2024-06-01 15:36:08] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 15:36:08] [INFO ] Invariant cache hit.
[2024-06-01 15:36:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:36:09] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-01 15:36:09] [INFO ] Invariant cache hit.
[2024-06-01 15:36:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:36:14] [INFO ] Deduced a trap composed of 80 places in 231 ms of which 4 ms to minimize.
[2024-06-01 15:36:14] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 99 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 121 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:36:17] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:36:17] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:36:17] [INFO ] Deduced a trap composed of 97 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:36:18] [INFO ] Deduced a trap composed of 147 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:36:18] [INFO ] Deduced a trap composed of 91 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:36:18] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:36:18] [INFO ] Deduced a trap composed of 113 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:36:19] [INFO ] Deduced a trap composed of 96 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:36:19] [INFO ] Deduced a trap composed of 100 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:36:19] [INFO ] Deduced a trap composed of 97 places in 258 ms of which 5 ms to minimize.
[2024-06-01 15:36:19] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:36:21] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:36:21] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:36:21] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:36:22] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:36:22] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:36:22] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:36:22] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:36:23] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:36:23] [INFO ] Deduced a trap composed of 128 places in 168 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:36:27] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:36:27] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:36:28] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:36:28] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:36:29] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:36:31] [INFO ] Deduced a trap composed of 99 places in 215 ms of which 4 ms to minimize.
[2024-06-01 15:36:31] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 4 ms to minimize.
[2024-06-01 15:36:31] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:36:31] [INFO ] Deduced a trap composed of 119 places in 214 ms of which 4 ms to minimize.
[2024-06-01 15:36:31] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 3 ms to minimize.
[2024-06-01 15:36:31] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:36:32] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 4 ms to minimize.
[2024-06-01 15:36:32] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:36:32] [INFO ] Deduced a trap composed of 98 places in 224 ms of which 5 ms to minimize.
[2024-06-01 15:36:33] [INFO ] Deduced a trap composed of 83 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:36:33] [INFO ] Deduced a trap composed of 101 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:36:33] [INFO ] Deduced a trap composed of 122 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:36:33] [INFO ] Deduced a trap composed of 108 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:36:34] [INFO ] Deduced a trap composed of 96 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:36:34] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:36:34] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:36:34] [INFO ] Deduced a trap composed of 109 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:36:35] [INFO ] Deduced a trap composed of 123 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:36:35] [INFO ] Deduced a trap composed of 89 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:36:35] [INFO ] Deduced a trap composed of 154 places in 253 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 15:36:37] [INFO ] Deduced a trap composed of 109 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:36:37] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 4 ms to minimize.
[2024-06-01 15:36:38] [INFO ] Deduced a trap composed of 112 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:36:38] [INFO ] Deduced a trap composed of 121 places in 277 ms of which 5 ms to minimize.
[2024-06-01 15:36:39] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 4 ms to minimize.
[2024-06-01 15:36:39] [INFO ] Deduced a trap composed of 70 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:36:39] [INFO ] Deduced a trap composed of 122 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:36:39] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:36:40] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 4 ms to minimize.
SMT process timed out in 30393ms, After SMT, problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 30401ms
Finished structural reductions in LTL mode , in 1 iterations and 31891 ms. Remains : 226/226 places, 343/343 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 4852 steps (0 resets) in 26 ms. (179 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 505 ms.
Product exploration explored 100000 steps with 20000 reset in 170 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 343/343 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 226 transition count 343
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 49 place count 226 transition count 343
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 90 place count 226 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 225 transition count 330
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 225 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 225 transition count 330
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 93 rules in 77 ms. Remains 225 /226 variables (removed 1) and now considering 330/343 (removed 13) transitions.
[2024-06-01 15:36:42] [INFO ] Redundant transitions in 41 ms returned []
Running 323 sub problems to find dead transitions.
// Phase 1: matrix 330 rows 225 cols
[2024-06-01 15:36:42] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 15:36:42] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 4 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 4 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:36:48] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:36:48] [INFO ] Deduced a trap composed of 63 places in 318 ms of which 4 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 5 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 4 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 4 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 4 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 20/35 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-06-01 15:36:53] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:36:53] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 4 ms to minimize.
[2024-06-01 15:36:53] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:36:53] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:36:54] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:36:54] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:36:54] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:36:54] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:36:55] [INFO ] Deduced a trap composed of 69 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:36:55] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 4 ms to minimize.
[2024-06-01 15:36:55] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:36:56] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:36:56] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:36:56] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:36:56] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 4 ms to minimize.
[2024-06-01 15:36:57] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:36:57] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:36:57] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:36:57] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:36:58] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 20/55 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/56 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 5 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 71 places in 229 ms of which 4 ms to minimize.
[2024-06-01 15:37:03] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 4 ms to minimize.
[2024-06-01 15:37:04] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:37:04] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:37:04] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:37:04] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:37:04] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:37:04] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:37:05] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:37:05] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:37:05] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:37:05] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:37:05] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:37:05] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:37:06] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:37:06] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 20/76 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-06-01 15:37:10] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 4 ms to minimize.
[2024-06-01 15:37:10] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 5 ms to minimize.
[2024-06-01 15:37:10] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 4 ms to minimize.
[2024-06-01 15:37:10] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 4 ms to minimize.
[2024-06-01 15:37:11] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 4 ms to minimize.
[2024-06-01 15:37:11] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 4 ms to minimize.
[2024-06-01 15:37:11] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:37:11] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 4 ms to minimize.
[2024-06-01 15:37:12] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:37:12] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 10/86 constraints. Problems are: Problem set: 91 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 225/555 variables, and 86 constraints, problems are : Problem set: 91 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/225 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 91 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 61/61 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 91/224 variables, 8/69 constraints. Problems are: Problem set: 91 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 7/76 constraints. Problems are: Problem set: 91 solved, 232 unsolved
[2024-06-01 15:37:18] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:37:18] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:37:18] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:37:19] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:37:19] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 4 ms to minimize.
[2024-06-01 15:37:19] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:37:19] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 4 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 4 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 4 ms to minimize.
[2024-06-01 15:37:20] [INFO ] Deduced a trap composed of 54 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:37:21] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 4 ms to minimize.
[2024-06-01 15:37:21] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 4 ms to minimize.
[2024-06-01 15:37:21] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 4 ms to minimize.
[2024-06-01 15:37:21] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 6 ms to minimize.
[2024-06-01 15:37:22] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:37:22] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:37:22] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 4 ms to minimize.
[2024-06-01 15:37:22] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 4 ms to minimize.
[2024-06-01 15:37:23] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 20/96 constraints. Problems are: Problem set: 91 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 224/555 variables, and 96 constraints, problems are : Problem set: 91 solved, 232 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/225 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 0/323 constraints, Known Traps: 81/90 constraints]
After SMT, in 60367ms problems are : Problem set: 91 solved, 232 unsolved
Search for dead transitions found 91 dead transitions in 60375ms
Found 91 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 91 transitions
Dead transitions reduction (with SMT) removed 91 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 225/226 places, 239/343 transitions.
Graph (complete) has 666 edges and 225 vertex of which 134 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.3 ms
Discarding 91 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 134 /225 variables (removed 91) and now considering 239/239 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 134/226 places, 239/343 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60523 ms. Remains : 134/226 places, 239/343 transitions.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 343/343 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 330
Applied a total of 2 rules in 9 ms. Remains 225 /226 variables (removed 1) and now considering 330/343 (removed 13) transitions.
// Phase 1: matrix 330 rows 225 cols
[2024-06-01 15:37:43] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:37:43] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 15:37:43] [INFO ] Invariant cache hit.
[2024-06-01 15:37:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:37:44] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-06-01 15:37:44] [INFO ] Invariant cache hit.
[2024-06-01 15:37:44] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-01 15:37:48] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 94 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 91 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 149 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 134 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 153 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:37:51] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 4 ms to minimize.
[2024-06-01 15:37:52] [INFO ] Deduced a trap composed of 88 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:37:52] [INFO ] Deduced a trap composed of 99 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:37:52] [INFO ] Deduced a trap composed of 98 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:37:53] [INFO ] Deduced a trap composed of 117 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:37:53] [INFO ] Deduced a trap composed of 124 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:37:53] [INFO ] Deduced a trap composed of 140 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:37:53] [INFO ] Deduced a trap composed of 110 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:37:54] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 4 ms to minimize.
[2024-06-01 15:37:54] [INFO ] Deduced a trap composed of 130 places in 255 ms of which 15 ms to minimize.
[2024-06-01 15:37:54] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-01 15:37:56] [INFO ] Deduced a trap composed of 99 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:37:58] [INFO ] Deduced a trap composed of 89 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:37:58] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:37:58] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 4 ms to minimize.
[2024-06-01 15:37:59] [INFO ] Deduced a trap composed of 127 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:37:59] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:37:59] [INFO ] Deduced a trap composed of 71 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:37:59] [INFO ] Deduced a trap composed of 57 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:38:00] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 4 ms to minimize.
[2024-06-01 15:38:00] [INFO ] Deduced a trap composed of 140 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:38:00] [INFO ] Deduced a trap composed of 132 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:38:01] [INFO ] Deduced a trap composed of 130 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:38:01] [INFO ] Deduced a trap composed of 112 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:38:01] [INFO ] Deduced a trap composed of 109 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:38:01] [INFO ] Deduced a trap composed of 104 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:38:02] [INFO ] Deduced a trap composed of 106 places in 184 ms of which 4 ms to minimize.
[2024-06-01 15:38:02] [INFO ] Deduced a trap composed of 92 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:38:02] [INFO ] Deduced a trap composed of 91 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:38:03] [INFO ] Deduced a trap composed of 133 places in 251 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-01 15:38:09] [INFO ] Deduced a trap composed of 102 places in 199 ms of which 4 ms to minimize.
[2024-06-01 15:38:09] [INFO ] Deduced a trap composed of 93 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:38:10] [INFO ] Deduced a trap composed of 83 places in 258 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-01 15:38:14] [INFO ] Deduced a trap composed of 149 places in 245 ms of which 3 ms to minimize.
[2024-06-01 15:38:14] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 4 ms to minimize.
SMT process timed out in 30285ms, After SMT, problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 30289ms
Starting structural reductions in LTL mode, iteration 1 : 225/226 places, 330/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31437 ms. Remains : 225/226 places, 330/343 transitions.
Treatment of property Anderson-PT-07-LTLFireability-04 finished in 161116 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 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 39 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-06-01 15:38:14] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 15:38:15] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 15:38:15] [INFO ] Invariant cache hit.
[2024-06-01 15:38:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:38:15] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2024-06-01 15:38:15] [INFO ] Redundant transitions in 4 ms returned []
Running 245 sub problems to find dead transitions.
[2024-06-01 15:38:15] [INFO ] Invariant cache hit.
[2024-06-01 15:38:15] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:38:17] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:38:17] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:38:24] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:38:27] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 3 ms to minimize.
[2024-06-01 15:38:27] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:38:27] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:38:28] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:38:28] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:38:29] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:38:29] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:38:29] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:38:29] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:38:29] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:38:29] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:38:30] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:38:31] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:38:31] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:38:31] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:38:32] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:38:32] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:38:32] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:38:32] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:38:33] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:38:33] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:38:33] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:38:33] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:38:33] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:38:33] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:38:33] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:38:34] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:38:34] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:38:34] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:38:34] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:38:34] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:38:35] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 252/387 variables, 135/231 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 42/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 273 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:38:47] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:38:47] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:38:47] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:38:47] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:38:47] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-06-01 15:38:48] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:38:49] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 106 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 90/90 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60999 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 10 reset in 141 ms.
Product exploration explored 100000 steps with 16 reset in 175 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12910 steps (2 resets) in 33 ms. (379 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-06-01 15:39:16] [INFO ] Invariant cache hit.
[2024-06-01 15:39:16] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 15:39:16] [INFO ] Invariant cache hit.
[2024-06-01 15:39:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:39:17] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-06-01 15:39:17] [INFO ] Redundant transitions in 3 ms returned []
Running 245 sub problems to find dead transitions.
[2024-06-01 15:39:17] [INFO ] Invariant cache hit.
[2024-06-01 15:39:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:39:19] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:39:20] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:39:21] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:39:21] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:39:21] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:39:21] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:39:21] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 1 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:39:25] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:39:26] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:39:28] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 3 ms to minimize.
[2024-06-01 15:39:28] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 3 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:39:31] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:39:31] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:39:33] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:39:33] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 6 ms to minimize.
[2024-06-01 15:39:33] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:39:33] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:39:33] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:39:33] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2024-06-01 15:39:33] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:39:34] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:39:34] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 252/387 variables, 135/231 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 42/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 273 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:39:48] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:39:49] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:39:49] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:39:49] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:39:49] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:39:50] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:39:51] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:39:52] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:39:52] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:39:53] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 106 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 90/90 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60775 ms. Remains : 135/135 places, 252/252 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10035 steps (1 resets) in 28 ms. (346 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15 reset in 130 ms.
Product exploration explored 100000 steps with 13 reset in 168 ms.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-06-01 15:40:18] [INFO ] Invariant cache hit.
[2024-06-01 15:40:18] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 15:40:18] [INFO ] Invariant cache hit.
[2024-06-01 15:40:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:40:18] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2024-06-01 15:40:18] [INFO ] Redundant transitions in 4 ms returned []
Running 245 sub problems to find dead transitions.
[2024-06-01 15:40:18] [INFO ] Invariant cache hit.
[2024-06-01 15:40:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:40:21] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:40:21] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:40:22] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:40:23] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:40:23] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:40:23] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:40:23] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:40:23] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:40:25] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:40:25] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:40:25] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:40:25] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 7 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:40:31] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:40:31] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:40:31] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:40:31] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:40:37] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:40:37] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:40:38] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:40:38] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:40:38] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:40:38] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 252/387 variables, 135/231 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 42/273 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 273 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:40:53] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:40:54] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:40:55] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 106 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 90/90 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61060 ms. Remains : 135/135 places, 252/252 transitions.
Treatment of property Anderson-PT-07-LTLFireability-06 finished in 184466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p1)&&G(p2)))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 236 transition count 427
Reduce places removed 34 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 41 rules applied. Total rules applied 75 place count 202 transition count 420
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 195 transition count 420
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 82 place count 195 transition count 378
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 166 place count 153 transition count 378
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 177 place count 142 transition count 259
Iterating global reduction 3 with 11 rules applied. Total rules applied 188 place count 142 transition count 259
Applied a total of 188 rules in 21 ms. Remains 142 /236 variables (removed 94) and now considering 259/461 (removed 202) transitions.
// Phase 1: matrix 259 rows 142 cols
[2024-06-01 15:41:19] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:41:19] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 15:41:19] [INFO ] Invariant cache hit.
[2024-06-01 15:41:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:41:20] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-06-01 15:41:20] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-06-01 15:41:20] [INFO ] Invariant cache hit.
[2024-06-01 15:41:20] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-01 15:41:22] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:41:23] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:41:24] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 3 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-01 15:41:26] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:41:26] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:41:27] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:41:27] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:41:27] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:41:27] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:41:27] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 259/401 variables, 142/198 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-01 15:41:41] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:41:41] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/401 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/401 variables, and 242 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-01 15:41:52] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:41:52] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:41:52] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:41:53] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:41:53] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:41:53] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:41:53] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:41:53] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:41:55] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 142/401 variables, and 73 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/142 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/252 constraints, Known Traps: 57/57 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/236 places, 259/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60976 ms. Remains : 142/236 places, 259/461 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-07
Product exploration explored 100000 steps with 117 reset in 235 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-07 finished in 61351 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 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 26 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-06-01 15:42:20] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:42:20] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 15:42:20] [INFO ] Invariant cache hit.
[2024-06-01 15:42:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:42:21] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-06-01 15:42:21] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-06-01 15:42:21] [INFO ] Invariant cache hit.
[2024-06-01 15:42:21] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:42:28] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:28] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:42:29] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:42:29] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:42:29] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:42:29] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:42:29] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:42:30] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:42:30] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:42:30] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:42:30] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:42:30] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:42:30] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:42:31] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:42:31] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:42:31] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:42:31] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:42:31] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:42:32] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:42:32] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:42:32] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:34] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:42:35] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:42:35] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:42:35] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:42:35] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:42:36] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:42:36] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:42:36] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:42:36] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:42:39] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:42:39] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:42:39] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:42:39] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:42:39] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:42:39] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:42:40] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:42:40] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:42:40] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:42:40] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:42:40] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:42:41] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:42:41] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:42:41] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:42] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:42:42] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:42:43] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:42:43] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:42:43] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:42:44] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:42:44] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:42:44] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:42:44] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:42:44] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:42:45] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:42:45] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:42:45] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:42:45] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:48] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:42:48] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:42:48] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:42:48] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:42:48] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:42:49] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:42:49] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:42:49] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:50] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:42:50] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/387 variables, and 108 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:42:54] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:42:54] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:42:54] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:42:55] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:42:56] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:42:57] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:43:00] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:43:03] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:43:03] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:43:03] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:43:03] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:43:03] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:43:03] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:43:04] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:43:04] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:43:05] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 3 ms to minimize.
[2024-06-01 15:43:05] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-06-01 15:43:05] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:43:05] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:43:05] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:43:05] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-06-01 15:43:06] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 17/146 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 146 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 130/130 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61210 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 178 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 1 ms.
FORMULA Anderson-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-11 finished in 61489 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(F(p1))||p0)))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 355
Applied a total of 20 rules in 11 ms. Remains 226 /236 variables (removed 10) and now considering 355/461 (removed 106) transitions.
// Phase 1: matrix 355 rows 226 cols
[2024-06-01 15:43:22] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 15:43:22] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 15:43:22] [INFO ] Invariant cache hit.
[2024-06-01 15:43:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:43:23] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 15:43:23] [INFO ] Invariant cache hit.
[2024-06-01 15:43:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:43:27] [INFO ] Deduced a trap composed of 98 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:43:27] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 4 ms to minimize.
[2024-06-01 15:43:28] [INFO ] Deduced a trap composed of 100 places in 191 ms of which 4 ms to minimize.
[2024-06-01 15:43:28] [INFO ] Deduced a trap composed of 97 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:43:28] [INFO ] Deduced a trap composed of 79 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:43:29] [INFO ] Deduced a trap composed of 85 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:43:29] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:43:30] [INFO ] Deduced a trap composed of 125 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:43:30] [INFO ] Deduced a trap composed of 117 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:43:30] [INFO ] Deduced a trap composed of 126 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:43:31] [INFO ] Deduced a trap composed of 122 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:43:31] [INFO ] Deduced a trap composed of 101 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:43:31] [INFO ] Deduced a trap composed of 130 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:43:32] [INFO ] Deduced a trap composed of 134 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:43:32] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:43:32] [INFO ] Deduced a trap composed of 116 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:43:32] [INFO ] Deduced a trap composed of 124 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:43:33] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 4 ms to minimize.
[2024-06-01 15:43:33] [INFO ] Deduced a trap composed of 91 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:43:33] [INFO ] Deduced a trap composed of 132 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:43:34] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:43:35] [INFO ] Deduced a trap composed of 137 places in 292 ms of which 4 ms to minimize.
[2024-06-01 15:43:35] [INFO ] Deduced a trap composed of 104 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 106 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 136 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 99 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 72 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:43:37] [INFO ] Deduced a trap composed of 88 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:43:37] [INFO ] Deduced a trap composed of 81 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:43:37] [INFO ] Deduced a trap composed of 96 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:43:38] [INFO ] Deduced a trap composed of 123 places in 216 ms of which 4 ms to minimize.
[2024-06-01 15:43:38] [INFO ] Deduced a trap composed of 87 places in 286 ms of which 4 ms to minimize.
[2024-06-01 15:43:38] [INFO ] Deduced a trap composed of 117 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:43:39] [INFO ] Deduced a trap composed of 149 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:43:39] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:43:39] [INFO ] Deduced a trap composed of 136 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:43:39] [INFO ] Deduced a trap composed of 69 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:43:40] [INFO ] Deduced a trap composed of 131 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:43:40] [INFO ] Deduced a trap composed of 109 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:43:40] [INFO ] Deduced a trap composed of 78 places in 249 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:43:45] [INFO ] Deduced a trap composed of 86 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:43:45] [INFO ] Deduced a trap composed of 112 places in 229 ms of which 4 ms to minimize.
[2024-06-01 15:43:45] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:43:47] [INFO ] Deduced a trap composed of 108 places in 269 ms of which 8 ms to minimize.
[2024-06-01 15:43:47] [INFO ] Deduced a trap composed of 86 places in 277 ms of which 5 ms to minimize.
[2024-06-01 15:43:47] [INFO ] Deduced a trap composed of 102 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:43:47] [INFO ] Deduced a trap composed of 89 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:43:48] [INFO ] Deduced a trap composed of 117 places in 221 ms of which 4 ms to minimize.
[2024-06-01 15:43:48] [INFO ] Deduced a trap composed of 117 places in 280 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 126 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 140 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 109 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:43:54] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 4 ms to minimize.
SMT process timed out in 30459ms, After SMT, problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 30466ms
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 355/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31939 ms. Remains : 226/236 places, 355/461 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-07-LTLFireability-12 finished in 32772 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 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 26 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-06-01 15:43:54] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:43:55] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-01 15:43:55] [INFO ] Invariant cache hit.
[2024-06-01 15:43:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:43:55] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2024-06-01 15:43:55] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-06-01 15:43:55] [INFO ] Invariant cache hit.
[2024-06-01 15:43:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:43:57] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:43:58] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 3 ms to minimize.
[2024-06-01 15:43:58] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:43:58] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 3 ms to minimize.
[2024-06-01 15:43:58] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:43:58] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:43:58] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:43:59] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:43:59] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:43:59] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:43:59] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:43:59] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:43:59] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:44:00] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:44:00] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:44:00] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:44:00] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:44:00] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:44:00] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:44:00] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:44:01] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 3 ms to minimize.
[2024-06-01 15:44:01] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:44:02] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:44:02] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:44:02] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:44:02] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:44:02] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:44:02] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:44:02] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:44:03] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 12 ms to minimize.
[2024-06-01 15:44:03] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:44:03] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:44:03] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:44:03] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:44:03] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:44:03] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:44:04] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:44:04] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:44:04] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:44:04] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:44:06] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 3 ms to minimize.
[2024-06-01 15:44:07] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-06-01 15:44:07] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:44:08] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:44:09] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:44:09] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:44:09] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:44:09] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:44:09] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:44:09] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:44:09] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:44:10] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:44:11] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:44:11] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:44:11] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:44:11] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:44:12] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:44:12] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:44:12] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:44:12] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:44:12] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:44:13] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:44:13] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:44:13] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:44:13] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:44:13] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:44:13] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:44:15] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:44:17] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 252/387 variables, 135/227 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 42/269 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 269 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 92 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 76/76 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60970 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32907 steps (6 resets) in 59 ms. (548 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-06-01 15:44:56] [INFO ] Invariant cache hit.
[2024-06-01 15:44:56] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-01 15:44:56] [INFO ] Invariant cache hit.
[2024-06-01 15:44:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:44:57] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-06-01 15:44:57] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-06-01 15:44:57] [INFO ] Invariant cache hit.
[2024-06-01 15:44:57] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:44:59] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:45:01] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:45:01] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:45:01] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:45:01] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:45:02] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:45:04] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:45:05] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:45:05] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:45:06] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:45:07] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:45:08] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:45:09] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:45:09] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:45:09] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:45:09] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:45:10] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:45:10] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:45:10] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:45:10] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:45:10] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:45:10] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:45:11] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:45:11] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:45:11] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:45:11] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:45:11] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:45:13] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:45:14] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 252/387 variables, 135/227 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 42/269 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 13 (OVERLAPS) 0/387 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 269 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 92 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 76/76 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60739 ms. Remains : 135/135 places, 252/252 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39398 steps (8 resets) in 80 ms. (486 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 8 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-06-01 15:45:58] [INFO ] Invariant cache hit.
[2024-06-01 15:45:59] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 15:45:59] [INFO ] Invariant cache hit.
[2024-06-01 15:45:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:45:59] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2024-06-01 15:45:59] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-06-01 15:45:59] [INFO ] Invariant cache hit.
[2024-06-01 15:45:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:46:02] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:46:02] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:46:02] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:46:02] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:46:04] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:46:04] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:46:04] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:46:04] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:46:04] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:46:06] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:46:06] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:46:07] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:46:08] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:46:09] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:46:09] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:46:09] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:46:09] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:46:09] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:46:10] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:46:10] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:46:10] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:46:12] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:46:13] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:46:13] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:46:15] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:46:15] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:46:15] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:46:15] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:46:16] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:46:16] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:46:16] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:46:16] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:46:16] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:46:17] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:46:17] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:46:17] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:46:17] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:46:17] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:46:18] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:46:18] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:46:18] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:46:18] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:46:18] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:46:19] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:46:20] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:46:20] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:46:20] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:46:20] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:46:21] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:46:21] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:46:21] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:46:21] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:46:21] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:46:21] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:46:22] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:46:25] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-01 15:46:27] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/387 variables, and 92 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/387 variables, and 92 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 76/76 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61186 ms. Remains : 135/135 places, 252/252 transitions.
Treatment of property Anderson-PT-07-LTLFireability-13 finished in 185033 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((F(G(p1))&&p0))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 355
Applied a total of 20 rules in 8 ms. Remains 226 /236 variables (removed 10) and now considering 355/461 (removed 106) transitions.
// Phase 1: matrix 355 rows 226 cols
[2024-06-01 15:46:59] [INFO ] Computed 16 invariants in 11 ms
[2024-06-01 15:47:00] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 15:47:00] [INFO ] Invariant cache hit.
[2024-06-01 15:47:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:47:01] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 15:47:01] [INFO ] Invariant cache hit.
[2024-06-01 15:47:01] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:47:06] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:47:06] [INFO ] Deduced a trap composed of 118 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:47:07] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:47:07] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:47:07] [INFO ] Deduced a trap composed of 103 places in 224 ms of which 4 ms to minimize.
[2024-06-01 15:47:07] [INFO ] Deduced a trap composed of 84 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:47:08] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:47:08] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:47:09] [INFO ] Deduced a trap composed of 95 places in 233 ms of which 4 ms to minimize.
[2024-06-01 15:47:09] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:47:09] [INFO ] Deduced a trap composed of 97 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:47:10] [INFO ] Deduced a trap composed of 57 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:47:10] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:47:10] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 4 ms to minimize.
[2024-06-01 15:47:10] [INFO ] Deduced a trap composed of 142 places in 272 ms of which 4 ms to minimize.
[2024-06-01 15:47:11] [INFO ] Deduced a trap composed of 94 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:47:11] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:47:11] [INFO ] Deduced a trap composed of 93 places in 270 ms of which 10 ms to minimize.
[2024-06-01 15:47:12] [INFO ] Deduced a trap composed of 102 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:47:12] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:47:13] [INFO ] Deduced a trap composed of 105 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:47:13] [INFO ] Deduced a trap composed of 119 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:47:14] [INFO ] Deduced a trap composed of 110 places in 206 ms of which 4 ms to minimize.
[2024-06-01 15:47:14] [INFO ] Deduced a trap composed of 102 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:47:14] [INFO ] Deduced a trap composed of 81 places in 240 ms of which 4 ms to minimize.
[2024-06-01 15:47:15] [INFO ] Deduced a trap composed of 124 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:47:15] [INFO ] Deduced a trap composed of 78 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 4 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 86 places in 250 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:47:23] [INFO ] Deduced a trap composed of 100 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:47:24] [INFO ] Deduced a trap composed of 92 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:47:24] [INFO ] Deduced a trap composed of 86 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:47:25] [INFO ] Deduced a trap composed of 82 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:47:25] [INFO ] Deduced a trap composed of 106 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:47:25] [INFO ] Deduced a trap composed of 97 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:47:26] [INFO ] Deduced a trap composed of 120 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:47:26] [INFO ] Deduced a trap composed of 119 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:47:26] [INFO ] Deduced a trap composed of 94 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:47:26] [INFO ] Deduced a trap composed of 108 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:47:27] [INFO ] Deduced a trap composed of 139 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:47:27] [INFO ] Deduced a trap composed of 114 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:47:27] [INFO ] Deduced a trap composed of 89 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:47:28] [INFO ] Deduced a trap composed of 106 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:47:28] [INFO ] Deduced a trap composed of 126 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:47:28] [INFO ] Deduced a trap composed of 61 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:47:28] [INFO ] Deduced a trap composed of 135 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:47:29] [INFO ] Deduced a trap composed of 100 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:47:29] [INFO ] Deduced a trap composed of 98 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:47:29] [INFO ] Deduced a trap composed of 95 places in 248 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 15:47:31] [INFO ] Deduced a trap composed of 123 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:47:31] [INFO ] Deduced a trap composed of 86 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 30343ms, After SMT, problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 30350ms
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 355/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31850 ms. Remains : 226/236 places, 355/461 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLFireability-14 finished in 32060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(p1))||(G(p2)&&F(p0))))))'
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)))'
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 15:47:32] [INFO ] Flatten gal took : 58 ms
[2024-06-01 15:47:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 15:47:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 236 places, 461 transitions and 1658 arcs took 18 ms.
Total runtime 852135 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Anderson-PT-07-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Anderson-PT-07-LTLFireability-06
Could not compute solution for formula : Anderson-PT-07-LTLFireability-13

BK_STOP 1717257025939

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Anderson-PT-07-LTLFireability-04
ltl formula formula --ltl=/tmp/4750/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 236 places, 461 transitions and 1658 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4750/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4750/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4750/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4750/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 238 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 237, there are 520 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1919
pnml2lts-mc( 0/ 4): unique states count: 1919
pnml2lts-mc( 0/ 4): unique transitions count: 2807
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1056
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2016
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2016 states 3298 transitions, fanout: 1.636
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.040 sec minimum, 0.055 sec on average)
pnml2lts-mc( 0/ 4): States per second: 33600, Transitions per second: 54967
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 27.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 465 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Anderson-PT-07-LTLFireability-06
ltl formula formula --ltl=/tmp/4750/ltl_1_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 236 places, 461 transitions and 1658 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4750/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4750/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4750/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4750/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 238 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 237, there are 470 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): ~2187 levels ~10000 states ~27828 transitions
pnml2lts-mc( 0/ 4): ~4340 levels ~20000 states ~55232 transitions
pnml2lts-mc( 3/ 4): ~8571 levels ~40000 states ~109260 transitions
pnml2lts-mc( 1/ 4): ~15987 levels ~80000 states ~224760 transitions
pnml2lts-mc( 1/ 4): ~30932 levels ~160000 states ~465424 transitions
pnml2lts-mc( 2/ 4): ~64200 levels ~320000 states ~897836 transitions
pnml2lts-mc( 2/ 4): ~127056 levels ~640000 states ~1832156 transitions
pnml2lts-mc( 2/ 4): ~248766 levels ~1280000 states ~3789272 transitions
pnml2lts-mc( 1/ 4): ~434299 levels ~2560000 states ~8486288 transitions
pnml2lts-mc( 1/ 4): ~812728 levels ~5120000 states ~17774516 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 102784
pnml2lts-mc( 0/ 4): unique states count: 9403709
pnml2lts-mc( 0/ 4): unique transitions count: 34069226
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 70641
pnml2lts-mc( 0/ 4): - claim found count: 16474270
pnml2lts-mc( 0/ 4): - claim success count: 9403725
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5714703
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9403733 states 34069292 transitions, fanout: 3.623
pnml2lts-mc( 0/ 4): Total exploration time 86.510 sec (86.490 sec minimum, 86.500 sec on average)
pnml2lts-mc( 0/ 4): States per second: 108701, Transitions per second: 393819
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 154.1MB, 13.7 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 35.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 465 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 154.1MB (~256.0MB paged-in)
ltl formula name Anderson-PT-07-LTLFireability-13
ltl formula formula --ltl=/tmp/4750/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 236 places, 461 transitions and 1658 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.080 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4750/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4750/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4750/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4750/ltl_2_
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 238 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 237, there are 470 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2062 levels ~10000 states ~24804 transitions
pnml2lts-mc( 1/ 4): ~4259 levels ~20000 states ~50376 transitions
pnml2lts-mc( 1/ 4): ~8413 levels ~40000 states ~100884 transitions
pnml2lts-mc( 1/ 4): ~16815 levels ~80000 states ~198084 transitions
pnml2lts-mc( 1/ 4): ~33274 levels ~160000 states ~399228 transitions
pnml2lts-mc( 1/ 4): ~65320 levels ~320000 states ~822320 transitions
pnml2lts-mc( 1/ 4): ~127550 levels ~640000 states ~1730632 transitions
pnml2lts-mc( 1/ 4): ~245697 levels ~1280000 states ~3660304 transitions
pnml2lts-mc( 0/ 4): ~483344 levels ~2560000 states ~8134572 transitions
pnml2lts-mc( 0/ 4): ~893096 levels ~5120000 states ~17345968 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6860
pnml2lts-mc( 0/ 4): unique states count: 9334466
pnml2lts-mc( 0/ 4): unique transitions count: 33870182
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7342
pnml2lts-mc( 0/ 4): - claim found count: 16084216
pnml2lts-mc( 0/ 4): - claim success count: 9334499
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5684171
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9334513 states 33870303 transitions, fanout: 3.629
pnml2lts-mc( 0/ 4): Total exploration time 84.710 sec (84.690 sec minimum, 84.698 sec on average)
pnml2lts-mc( 0/ 4): States per second: 110194, Transitions per second: 399838
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 153.7MB, 13.7 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 35.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 465 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 153.7MB (~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="Anderson-PT-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118300340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-07.tgz
mv Anderson-PT-07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;